Controlling Access to Resources Based on Affinity Planes and Sectors

ABSTRACT

A first person (which may be a natural person, organization, brand, or other entity) has one or more affinity planes. Each affinity plane represents a distinct closeness of relationship with the first person. The first person also has one or more sectors, each of which may be associated with a domain. Each of the other people may be associated with zero or more of the first person&#39;s affinity planes and zero or more of the first person&#39;s sectors. Each of the first person&#39;s resources may be associated with zero or more of the first person&#39;s affinity planes and zero or more of the first person&#39;s sectors. A request by one of the other people to access one of the first person&#39;s resources is granted based on the overlap between the affinity planes and sectors associated with the requestor and the affinity planes and sectors associated with the requested resource.

CROSS-REFERENCE TO RELATED APPLICATIONS

This application claims the benefit of U.S. Prov. Pat. App. Ser. No.61/684,690, filed on Aug. 17, 2012, entitled, “Controlling Access toResources Based on Affinity Planes and Sectors” (Attorney Docket No.F0007-1001L), which is hereby incorporated by reference herein.

BACKGROUND

People use computers and computer networks to store and transmit anincreasingly wide variety of information, ranging from highly sensitivemedical information to photos of sporting events to corporate financialreports. Such information can vary widely not only in its content andform, but also in the extent to which its creators and owners wish toshare it with others. Due to the inherent ability of computers to copydigital data quickly, easily, and with perfect accuracy, and theinherent ability of computer networks to transmit digital data to anearly limitless number of people instantly and worldwide, in many casesthe mere act of posting information on the Internet, or even of storinginformation on a personal computer, makes that information quickly andeasily available to a larger number and wider variety of people than theposter desires. Information availability, in other words, remainslargely an “all-or-nothing” proposition on the Internet.

Although various systems exist for enabling the creators and owners ofdigital data to exert control over the extent to which such data aremade available to others, such systems have a variety of shortcomings.For example, online social networking systems, such as Facebook, enableeach of their members to designate certain other people as being“within” their online social network. Once a person has designated sucha group of “friends” (in Facebook parlance), the person can make certaininformation available through the online social networking system onlyto friends and not to non-friends. Although such a system represents animprovement over a true all-or-nothing system of content access control,it still has a variety of drawbacks. One such drawback is that the merebinary distinction between friends and non-friends does not enablefiner-grained distinctions to be implemented by the system. This cancause significant problems when, as is commonly the case, a personallows relatively unknown acquaintances into his or her circle offriends, thereby potentially nullifying the access control-relatedbenefits of the system.

What is needed, therefore, are improved techniques for providing peoplewith control over access to their digital resources.

SUMMARY

Access to a first person's electronic resources by people(“connections”) in the network of a first person (which may be a naturalperson, organization, brand, or other entity) is controlled based onrelationships between the first person and the connections. Inparticular, one or more affinity planes are associated with the firstperson. Each affinity plane represents an aspect of commonality with thefirst person. Furthermore, one or more sectors, each of which may beassociated with a domain, are associated with the first person. Each ofthe connections may be associated with zero or more of the firstperson's affinity planes and zero or more of the first person's sectors.Each of the first person's resources may be associated with zero or moreof the first person's affinity planes and zero or more of the firstperson's sectors. Associations between the first person's connectionsand the first person's affinity planes and sectors may be createdautomatically or manually. For example, the first person may use agraphical user interface to move icons representing the first person'sconnections into regions representing the affinity planes and/or sectorswith which those connections should be associated. Each of the firstperson's connections may be granted access to only those resourcesassociated with the same affinity planes and sectors as the connection.For example, embodiments of the present invention may present agraphical user interface associated with the first person which, whenrendered to of the first person's connections, is dynamically customizedto present to that connection only resources associated with the sameaffinity planes and sectors of the first person as the connection.

For example, one embodiment of the present invention is directed to amethod for use with a system. The system includes: a plurality ofaffinity planes associated with a first person P₀; a plurality ofsectors associated with first person P₀; and data representing anassociation Affinity_P₀ (A₀, P₁) between an affinity plane A₀ and secondperson P₁, wherein the affinity plane A₀ is within the plurality ofaffinity planes associated with first person P₀; data representing anassociation Sector_P₀(S₀, P₁) between a sector S₀ and second person P₁,wherein the sector S₀ is within the plurality of sectors associated withfirst person P₀; data representing an association Affinity_P₀ (A₁, R₀)between an affinity plane A₁ and a first resource R₀, wherein theaffinity plane A₁ is within the plurality of affinity planes associatedwith first person P₀; and data representing an association Sector_P₀(S₁, R₀) between a sector S₁ and first resource R₀, wherein the sectorS₁ is within the plurality of sectors associated with first person P₀.The method includes: (1) determining whether affinity plane A₀ includesaffinity plane A₁; (2) determining whether sector S₀ includes sector S₁;and (3) granting person P₁ with access to resource R₀ if: (a) affinityplane A₀ is determined to include affinity plane A₁; and (b) sector S₀is determined to include sector S₁.

Another embodiment of the present invention is directed to a methodincluding: (1) receiving first data related to a first person P₀; (2)analyzing the first data to identify a first closeness of relationshipbetween the first person P₀ and a second person P₁; (3) selecting, basedon the first closeness of relationship, a first affinity plane selectedfrom a plurality of affinity planes associated with the first person P₀,wherein the plurality of affinity planes includes the first affinityplane, wherein the first affinity plane represents the first closenessof relationship; and a second affinity plane representing a secondcloseness of relationship, wherein the first closeness of relationshipdiffers from the second closeness of relationship; and (4) associatingthe first affinity plane with the second person P.

Another embodiment of the present invention is directed to a method foruse with a system. The system includes: a plurality of affinity planesassociated with a first person P₀; a plurality of sectors associatedwith first person P₀; and data representing an association Sector_P₀(S₀,P₁) between a sector S₀ and second person P₁, wherein the sector S₀ iswithin the plurality of sectors associated with first person P₀; datarepresenting an association Affinity_P₀ (A₁, R₀) between an affinityplane A₁ and a first resource R₀, wherein the affinity plane A₁ iswithin the plurality of affinity planes associated with first person P₀;data representing an association Sector_P₀ (S₁, R₀) between a sector S₁and first resource R₀, wherein the sector S₁ is within the plurality ofsectors associated with first person P₀. The method includes: (1)determining whether sector S₀ includes sector S₁; and (2) grantingperson P₁ with access to resource R₀ if: sector S₀ is determined toinclude sector S₁.

Another embodiment of the present invention is directed to a method foruse with a system. The system includes: a plurality of affinity planesassociated with a first person P₀; a plurality of sectors associatedwith first person P₀; data representing an association Affinity_P₀ (A₀,P₁) between an affinity plane A₀ and second person P₁, wherein theaffinity plane A₀ is within the plurality of affinity planes associatedwith first person P₀; data representing an association Affinity_P₀ (A₁,R₀) between an affinity plane A₁ and a first resource R₀, wherein theaffinity plane A₁ is within the plurality of affinity planes associatedwith first person P₀; and data representing an association Sector_P₀(S₁, R₀) between a sector S₁ and first resource R₀, wherein the sectorS₁ is within the plurality of sectors associated with first person P₀.The method includes: (1) determining whether affinity plane A₀ includesaffinity plane A₁; and (2) granting person P₁ with access to resource R₀if affinity plane A₀ is determined to include affinity plane A₁.

Another embodiment of the present invention is directed to a method foruse with a system. The system includes: a plurality of affinity planesassociated with a first person P₀; a plurality of sectors associatedwith first person P₀; data representing an association Affinity_P₀ (A₀,P₁) between an affinity plane A₀ and second person P₁, wherein theaffinity plane A₀ is within the plurality of affinity planes associatedwith first person P₀; data representing an association Sector_P₀(S₀, P₁)between a sector S₀ and second person P₁, wherein the sector S₀ iswithin the plurality of sectors associated with first person P₀; datarepresenting an association Sector_P₀ (S₁, R₀) between a sector S₁ andfirst resource R₀, wherein the sector S₁ is within the plurality ofsectors associated with first person P₀. The method includes: (1)determining whether sector S₀ includes sector S₁; and (2) grantingperson P₁ with access to resource R₀ if sector S₀ is determined toinclude sector S₁.

Another embodiment of the present invention is directed to a method foruse with a system. The system includes: a plurality of affinity planesassociated with a first person P₀; a plurality of sectors associatedwith first person P₀; data representing an association Affinity_P₀ (A₀,P₁) between an affinity plane A₀ and second person P₁, wherein theaffinity plane A₀ is within the plurality of affinity planes associatedwith first person P₀; data representing an association Sector_P₀(S₀, P₁)between a sector S₀ and second person P₁, wherein the sector S₀ iswithin the plurality of sectors associated with first person P₀; anddata representing an association Affinity_P₀ (A₁, R₀) between anaffinity plane A₁ and a first resource R₀, wherein the affinity plane A₁is within the plurality of affinity planes associated with first personP₀.

The method includes: (1) determining whether affinity plane A₀ includesaffinity plane A₁; and (2) granting person P₁ with access to resource R₀if affinity plane A₀ is determined to include affinity plane A₁.

Another embodiment of the present invention is directed to a method foruse with a system. The system includes: a plurality of affinity planesassociated with a first person P₀; and affinity plane association datarepresenting a plurality of associations between the plurality ofaffinity planes and a plurality of resources and people. The methodincludes: (1) displaying a graphical representation of each of theplurality of affinity planes, including: (a) for a first and secondaffinity plane in the plurality of affinity planes: (i) selecting afirst location at which to display a graphical representation of thefirst affinity plane; (ii) displaying the graphical representation ofthe first affinity plane at the first location; (iii) selecting a secondlocation at which to display a graphical representation of the secondaffinity plane; (iv) displaying the graphical representation of thesecond affinity plane at the second location; wherein (1) (a) (i) and(1) (a) (iii) comprise selecting the first and second locations suchthat the distance between the first and second locations is based on thenumber of resources and/or people in common between the first and secondaffinity planes.

Another embodiment of the present invention is directed to a method foruse with a system. The system includes: a plurality of affinity planesassociated with a first person P₀; and affinity plane association datarepresenting a plurality of associations between the plurality ofaffinity planes and a plurality of resources and people. The methodincludes: (1) rendering a graphical representation of a first affinityplane in the plurality of affinity planes, comprising: (1)(a)identifying a first value of a characteristic of the first affinityplane; (1) (b) selecting a first graphical feature based on the firstvalue of the characteristic of the first affinity plane; (1)(c)rendering the graphical representation of the first affinity plane tohave the first graphical feature; (2) rendering a graphicalrepresentation of a second affinity plane in the plurality of affinityplanes, comprising: (2)(a) identifying a second value of thecharacteristic of the second affinity plane; (2) (b) selecting a secondgraphical feature based on the second value of the characteristic of thesecond affinity plane; and (2)(c) rendering the graphical representationof the second affinity plane to have the second graphical feature. Thefirst graphical feature differs from the second graphical feature.

Another embodiment of the present invention is directed to a method foruse with a system. The system includes: a plurality of affinity planesassociated with a first person P₀; and affinity plane association datarepresenting a plurality of associations between the plurality ofaffinity planes and a plurality of resources and people. The methodincludes: (1) identifying, for each of a plurality of people P_(n), anaffinity contribution for person P_(n) in relation to the first personP₀, based on at least one frequency of occurrence of person P_(n) inperson P₀'s affinity planes; (2) summing the affinity contributions forthe plurality of people P_(n) to produce an affinity total; and (3)identifying an affinity index for each of the plurality of people P_(n)by dividing person P_(n)'s affinity contribution by the affinity total.

Other features and advantages of various aspects and embodiments of thepresent invention will become apparent from the following descriptionand from the claims.

BRIEF DESCRIPTION OF THE DRAWINGS

FIG. 1A is a diagram illustrating affinity planes of a first personaccording to one embodiment of the present invention.

FIG. 1B is a diagram which illustrates sectors of a first personaccording to one embodiment of the present invention.

FIG. 1C is a diagram which illustrates resources of a first personaccording to one embodiment of the present invention.

FIG. 2 is a diagram illustrating an example of a system containingaffinity plane data according to one embodiment of the presentinvention.

FIGS. 3A-3D are diagrams illustrating data representing relationshipsamong affinity planes, sectors, people, and resources according to oneembodiment of the present invention.

FIG. 4 is a dataflow diagram of a system for processing resource accessrequests according to one embodiment of the present invention.

FIG. 5 is a flowchart of a method performed by the system of FIG. 4according to one embodiment of the present invention.

FIG. 6 is a dataflow diagram of a system for automatically assigningpeople to affinity planes of a first person according to one embodimentof the present invention.

FIG. 7 is a flowchart of a method performed by the system of FIG. 6according to one embodiment of the present invention.

FIG. 8 is a dataflow diagram of a system for enabling a person tomanually associate other people with his or her affinity planes andsectors according to one embodiment of the present invention.

FIG. 9 is a flowchart of a method performed by the system of FIG. 8according to one embodiment of the present invention.

FIGS. 10A-10C are illustrations of graphical user interfaces used toassociate people and resources with affinity planes and sectorsaccording to various embodiments of the present invention;

FIG. 11 is an illustration of a graphical user interface for displayingresources and sectors associated with a first person and accessible to asecond person according to one embodiment of the present invention.

FIG. 12 is an illustration of a graphical user interface displayingaffinity planes using circles, and in which the sizes and distancesbetween circles represent properties of the affinity planes and theirrelationships with each other according to one embodiment of the presentinvention.

FIG. 13 is an illustration of a graphical user interface representing ahistory of a person's affinity planes and sectors according to oneembodiment of the present invention.

DETAILED DESCRIPTION

The continued inability of the leading online social networking systems,such as those provided by Facebook, Google, and LinkedIn, to providetheir users with a flexible, fine-grained, and user-friendly system forcontrolling access to resources (such as documents, photographs, andvideos), demonstrates the need for such a system. By default, forexample, existing systems make most or all of a user's resourcesavailable to everyone within that user's online social network. Suchsystems, however, continue to thwart users' desires and expectations foraccess control, ranging from the merely annoying (as in the case where afriend who was not invited to a party sees pictures of that party) tothe truly harmful (as in the case where an employer fires an employeeafter reading comments critical of the employer written by the employeeto a co-worker).

To overcome these and other problems with the state of the art incontrol of online resources, embodiments of the present inventionprovide an intuitive, tiered system that may be used to clearly definewho has access to different resources of a particular user, and when andhow such access should be granted. Although embodiments of the presentinvention may be used as standalone systems, they are particularlyuseful in conjunction with existing online social networking systems,such as Facebook, LinkedIn, Second Life, Yelp, and Meetup, to name onlya few. Furthermore, although embodiments of the present invention may beused to enable users to maintain their online privacy, embodiments ofthe present invention may be used more generally for a wide variety ofpurposes related to online resource access control.

For example, embodiments of the present invention are directed totechniques for enabling people to control access to their electronicresources, such as their documents, digital photographs, music, andvideos. In particular, access to a first person's electronic resourcesby other people is controlled based on relationships between the firstperson and the other people. In particular, one or more affinity planesare associated with the first person. Each affinity plane represents anaspect of commonality with the first person. Furthermore, one or moresectors, each of which may be associated with a domain, are associatedwith the first person. Each of the other people may be associated withzero or more of the first person's affinity planes and zero or more ofthe first person's sectors. Each of the first person's resources may beassociated with zero or more of the first person's affinity planes andzero or more of the first person's sectors. A request by one of theother people to access one of the first person's resources is grantedbased on the overlap between the affinity planes and sectors associatedwith the requestor and the affinity planes and sectors associated withthe requested resource.

For example, referring to FIG. 1A, a diagram is shown which illustratesaffinity planes of a first person P₀. In the particular example of FIG.1A, person P₀ has three affinity planes 102 a, 102 b, and 102 c. Theparticular number of affinity planes shown in FIG. 1A, however, ismerely an example and does not constitute a limitation of the presentinvention. More generally, embodiments of the present invention may beused in connection with people having any number of affinity planes(including zero affinity planes). Furthermore, as will be described inmore detail below, different people may have different numbers ofaffinity planes.

As stated above, each of person P₀'s affinity planes represents anaspect of commonality with person P₀. Each of person P₀'s affinityplanes may, for example, represent a distinct degree of closeness ofrelationship with person P₀. For example, in FIG. 1A, affinity plane 102c may represent a relatively distant relationship with person P₀,affinity plane 102 b may represent a closer relationship with person P₀than affinity plane 102 c, and affinity plane 102 a may represent acloser relationship with person P₀ than affinity plane 102 b. Thishierarchy of relationships is represented in FIG. 1A by the concentriccircles that represent affinity planes 102 a-c.

More generally, however, affinity planes may represent any type ofaffinity or aspect of commonality, such as social affinities (e.g.,family, work, home), or domain-based affinities (e.g., music, art,sports). Each person may, for example, define his or her own affinityplanes. As a result, affinity planes may, but need not, reflect anypredefined concept or category, but rather may reflect a particularperson's own definitions of different aspects of commonality with thatperson.

In the particular example of FIG. 1A, affinity plane 102 a is fullycontained within affinity plane 102 b and affinity plane 102 b is fullycontained within affinity plane 102 c. This set of concentricrelationships, however, is merely an example and does not constitute alimitation of the present invention. Alternatively, for example,affinity planes may be disjoint or overlap with each other in any of avariety of ways.

FIG. 1A merely provides a visual representation of the affinity planes102 a-c for ease of illustration and explanation. The circles that areused to represent the affinity planes 102 a-c in FIG. 1A, therefore, arenot the affinity planes themselves but rather merely one way in whichthe affinity planes 102 a-c may be displayed graphically. Moregenerally, affinity planes may be displayed and otherwise manifested inany of a variety of ways. Furthermore, affinity planes may berepresented and stored using any of a variety of data structures.

A user may consider some of his or her affinity planes to be moreimportant than others. To reflect such relative importance of differentaffinity planes, weights may (but need not) be associated with affinityplanes. For example, each of a user's affinity planes may have acorresponding weight. The weights of the user's affinity planes may, forexample, represent percentages, in which case all of the user's affinityplane weights may sum to 1.0 or 100%. The system may assign a user'saffinity planes initial default weights. For example, the system mayinitially assign all of a user's affinity planes equal weights. Asanother example, the user may select a predefined set of affinity planeshaving predefined, but not necessarily equal, weights. The system mayenable the user to manually change any one or more of the weights at anytime.

In addition to or instead of weights, affinity planes may be associatedwith ranks. Although the ranks associated with a particular set ofaffinity planes may be a set of consecutive numbers (e.g., 1, 2, 3,etc.), more generally such ranks may be any set of ordered and unequalsymbols. The system may assign a user's affinity planes initial defaultranks, such as sequential ranks corresponding to the sequence in whichthe affinity planes were created. The system may enable the user tomanually change any one or more of the ranks at any time.

A user may find it useful to associate both weights and ranks withaffinity planes for any of a variety of reasons. For example, the usermay find it useful to correlate weights with the importance of affinityplanes, and to correlate ranks with the activity level within affinityplanes.

Furthermore, as stated above, a person may have zero or more sectors. Ingeneral, each sector is associated with a domain, such as a topic ofinterest. For example, a domain may represent a topic such as music,finance, creativity, gas stations, sports, or categories, such aspictures, “likes” on Facebook or other social networking systems, movierecommendations, URLs, XML tags, and VRML tags.

For example, referring to FIG. 1B, a diagram is shown which illustratessectors of the first person P₀. In the particular example of FIG. 1B,person P₀ has three sectors 112 a, 112 b, and 112 c. The particularnumber of sectors shown in FIG. 1B, however, is merely an example anddoes not constitute a limitation of the present invention. Moregenerally, embodiments of the present invention may be used inconnection with people having any number of sectors (including zerosectors). Furthermore, as will be described in more detail below,different people may have different numbers of sectors.

As stated above, each of person P₀'s sectors represents a distinctdomain. For example, in FIG. 1B, sector 112 a may represent music,sector 112 b may represent business, and sector 112 c may representvacations.

As illustrated by FIG. 1B, a sector may cut across (overlap) any numberof affinity planes. In the example of FIG. 1B, sector 112 a overlaps allof person P₀'s affinity planes (indicating that person P₀ is open tosharing music-related resources with people regardless of theircloseness of relationship to person P₀), sector 112 b overlaps only withperson P₀'s affinity planes 102 b and 102 c (indicating that person P₀is not open to sharing business-related resources with people who arevery closely related to person P₀, perhaps out of a desire not to mixbusiness with personal life), and sector 112 c overlaps only withaffinity plane 112 c (indicating that P₀ is open to sharingvacation-related resources only with people to whom person P₀ is closelyrelated). The particular overlaps of sectors and affinity planes shownin FIG. 1B is merely an example and does not constitute a limitation ofthe present invention.

Although in the example of FIG. 1B the sectors 112 a-c are disjoint,this is merely an example and does not constitute a limitation of thepresent invention. Sectors may, for example, overlap each other orwholly contain each other.

Furthermore, although the sectors 112 a-c are illustrated in FIG. 1A aswedges, and therefore are intended to convey that each of the sectors112 a-c is defined by some domain, and that the overlap of each of thesectors 112 a-c with a particular one of the affinity planes 102 a-ctherefore includes all resources within the corresponding domain in thataffinity plane, this is merely an example and does not constitute alimitation of the present invention. The area of overlap between aparticular sector and a particular affinity plane may include any subsetof the resources within that affinity plane. For example, the owner of aset of resources may arbitrarily associate any subset of those resourceswith a particular sector, in which case the visual representation ofthat sector may be in the form of a box, set of points, or othershape(s).

FIG. 1B merely provides a visual representation of the sectors 112 a-cfor ease of illustration and explanation. The wedges and partial wedgesthat are used to represent the sectors 112 a-c in FIG. 1B, therefore,are not the sectors themselves but rather merely one way in which thesectors 112 a-c may be displayed graphically. More generally, sectorsmay be displayed and otherwise manifested in any of a variety of ways.Furthermore, sectors may be represented and stored using any of avariety of data structures.

Associations between person P₀'s affinity planes and other people, andassociations between person P₀'s sectors and other people may be createdin any of a variety of ways. For example, in general, associationsbetween a person P₁ and one of person P₀'s affinity planes or sectorsmay be created automatically or manually.

Embodiments of the present invention may create such associationsautomatically in any of a variety of ways. For example, referring toFIG. 6, a dataflow diagram is shown of a system 600 for automaticallyassigning people to affinity planes of person P₀ according to oneembodiment of the present invention. Referring to FIG. 7, a flowchart isshown of a method 700 performed by the system 600 of FIG. 6 according toone embodiment of the present invention.

In general, the system 600 includes an affinity plane assignment module602, which receives as input data drawn from one or more data sourcesrelated to people with whom person P₀ has relationships (FIG. 7,operation 702). Although a few sources 604 a-c of such data are shown inFIG. 6 for purposes of example, such sources 604 a-c are merely examplesand do not constitute limitations of the present invention. Moregenerally, the affinity plane assignment module 602 may draw on sourcesother than and/or in addition to the sources 604 a-c shown in FIG. 6.

The affinity plane assignment module 602 may, for example, receive asinput a set of data 604 a representing “friends” of person P₀, where theterm “friends” is used herein as a shorthand for people who are deemedby some data source (e.g., one or more online social networking systems)to be within a network of person P₀ (FIG. 7, operation 702). Examples ofpeople who may be represented by the friends data 604 a include personP₀'s Facebook friends, person P₀'s Twitter followers, and person P₀'sLinkedIn connections. As these examples illustrate, the friends data 604a may include data drawn from one or more online social networkingsystems. As a result, and as will become clear from the descriptionbelow, the system may use information about person P₀ from a variety ofsources to create a unified definition or “federated profile” of personP₀'s affinity planes and sectors across all of person P₀'s digitalnetworks.

The affinity plane assignment module 602 may automatically assign eachof some or all of the friends represented by the friends data 604 a toone or more of person P₀'s affinity planes (FIG. 7, operation 704). Theaffinity plane assignment module 602 may store data representing theassociation of person P0's friends with person P₀'s affinity planes inaffinity plane-person association data 304 a, which will be described inmore detail in connection with FIG. 3A.

The affinity plane assignment module 602 may assign person P₀'s friendsto person P₀'s affinity planes in any of a variety of ways. For example,the module 602 may assign all of person P₀'s friends to the samepredetermined affinity plane (e.g., affinity plane 102 a or 102 c). Asanother example, the module 602 may analyze the social network graphrepresented by the friends data 604 a (in which each node in the graphrepresents a person and in which each edge connecting a pair of nodesrepresents a “friend” relationship between the people represented by thepair of nodes) and assign friends to affinity planes based on the socialnetwork graph. For example, the module 602 may assign friends who areindicated by the friends data 604 a as having a relatively closerelationship to person P₀ to more central affinity planes than friendswho are indicated by the friends data 604 a as having relatively distantrelationships to person P₀. For example, if the social network graphrepresented by the friends data 604 a indicates that person P₀ has avery close relationship to person P₁ and a distant relationship toperson P₂, then the module 602 may assign person P₁ to affinity plane102 a (FIG. 1A) and assign person P₂ to affinity plane 102 c, sinceaffinity plane 102 a is more central than affinity plane 102 c. In thecase of social networking systems, such as LinkedIn, which expresslystore a degree of connection between pairs of people (e.g., firstdegree, second degree, third degree), such a degree of connection maydictate or influence the module 602's assignment of friends to affinityplanes.

As another example, the affinity plane assignment module 602 may receiveas input a set of data 604 b representing one or more address books ofperson P₀, such as electronic address books from installed softwareapplications (e.g., Microsoft Outlook, Sage ACT!), cloud-based softwareapplications (e.g., SalesForce, Google Contacts, Yahoo! Contacts),electronic address books within online social networking systems (e.g.,Facebook, Twitter, LinkedIn), databases, and documents containingcontact information (FIG. 7, operation 706). The address book data 604 bmay include any of a variety of information about one or more peopleother than person P₀, such as real name, nickname, mailing address,email address, and telephone number. As these examples illustrate, theaddress book data 604 b may include data drawn from one or more sources.

The affinity plane assignment module 602 may automatically assign eachof some or all of the contacts represented by the address book data 604b to one or more of person P₀'s affinity planes (FIG. 7, operation 708).The affinity plane assignment module 602 may store data representing theassociation of person P0's contacts with person P₀'s affinity planes inaffinity plane-person association data 304 a (FIG. 3A).

The affinity plane assignment module 602 may assign person P₀'s contactsto person P₀'s affinity planes in any of a variety of ways. For example,in general, the module 602 may use any of a variety of techniques toanalyze the address book data 604 b and to identify, for each contactrepresented by the address book data 604 b, a mapping between thatcontact's relationship with person P₀ and a corresponding one or more ofperson P₀'s affinity planes. For example, if person P₀'s affinity planesrepresent different degrees of closeness of relation with person P₀,then the module 602 may analyze the address book data 604 b to identify,for each contact represented by the address book data 604 b, a closenessof relationship between that contact and person P₀. Then the module 602may identify, for each contact, an affinity plane of person P₀ thatcorresponds to the contact's identified closeness of relationship toperson P₀ and assign the contact to the identified affinity plane.

The module 602 may identify a mapping between a particular contact'srelationship with person P₀ and a corresponding one or more of personP₀'s affinity planes in any of a variety of ways based on the addressbook data 604 b. For example, the module 602 may take into account anysimilarity between any one or more of the following characteristicsbetween a contact and person P₀ when identifying a mapping between aparticular contact and person P₀'s affinity planes: last name, homeaddress, employer, demographic information (e.g., age, gender,nationality, religion), industry, and interests.

As another example, the affinity plane assignment module 602 may receiveas input a set of data 604 c representing one or more messages sentand/or received by person P₀ (FIG. 7, operation 710). Such messages may,for example, include any one or more of the following: email messages,text messages, voicemail messages, blog postings, web pages (e.g., webpages created, edited, or viewed by person P₀), and messages sent orreceived by person P₀ via an online social networking system (e.g.,Facebook, Twitter, or LinkedIn). As these examples illustrate, themessage data 604 c may include data drawn from one or more sources.

The affinity plane assignment module 602 may automatically identify oneor more people associated with the messages 604 c and automaticallyassign each of some or all of those people to one or more of person P₀'saffinity planes (FIG. 7, operation 712). The affinity plane assignmentmodule 602 may store data representing the association of peopleassociated with the messages 604 c with person P₀'s affinity planes inaffinity plane-person association data 304 a (FIG. 3A).

The module 602 may identify people associated with the messages 604 c inany of a variety of ways. For example, the module 602 may identify asender of a message, a recipient of a message, a person mentioned in amessage (e.g., a person whose name appears in a message or who has beentagged as appearing in a photograph or other image), a person who hasedited a message, or a person who has viewed or listened to a message asa person “associated with” the message.

The affinity plane assignment module 602 may assign the peopleassociated with the messages 604 c to person P₀'s affinity planes in anyof a variety of ways. For example, the module 602 may create a graph ofconnections between person P₀ and people associated with the messages604 c, e.g., based on the identities of the senders and recipients ofthe messages 604 c. The module 602 may then use any of the techniquesdisclosed above with respect to the social network graph of person P₀'sfriends 604 a, described above, to associate the people associated withthe messages 604 c to person P₀'s affinity planes.

As another example, the module 602 may take into account any one or moreof the following to associate people associated with the messages 604 cwith person P₀'s affinity planes:

-   -   the number of messages associated with a particular person,        where a larger number of messages may be interpreted as        reflecting a closer relationship with person P₀;    -   the frequency of communication with a particular person, where a        higher frequency may be interpreted as reflecting a closer        relationship with person P₀;    -   the type of communication with a particular person (e.g.,        business vs. personal), where the type of communication may be        mapped to a corresponding affinity plane (e.g., if a person        predominantly engages in business communication with person P₀        then the person may be associated with person P₀'s “business”        affinity plane);    -   whether a particular person is a sender or recipient of a        message, where being a recipient may be interpreted as        reflecting a closer relationship with person P₀;    -   whether a particular person is the sole recipient of a message        or one of multiple recipients, where being a sole recipient may        be interpreted as reflecting a closer relationship of the        recipient with person P₀;    -   whether person P₀ is the sole recipient of a message or one of        multiple recipients, where being a sole recipient may be        interpreted as reflecting a closer relationship of the sender        with person P₀;    -   how recently the message was sent, where greater recency may be        interpreted as reflecting a closer relationship of the sender        with person P₀; and    -   whether or not the message was opened/viewed by the recipient,        where an opened/viewed message may be interpreted as reflecting        a closer relationship of the sender/recipient with person P₀        than an unopened or unviewed message.

As another example, the module 602 may take into account any content(data and/or metadata) of the messages 604 c to associate people withperson P₀'s affinity planes. Examples of such content include, but arenot limited to: subject, send date, receipt date, keywords, tags (e.g.,meta-tags), headers, and attachments. For example, if a particularperson is the sender or recipient of a message, the module 602 mayanalyze the data and/or metadata of the message and assign the person toone or more of person P₀'s affinity planes based, at least in part, onthe analysis. As one simple example, each of person P₀'s affinity planesmay be associated with one or more keywords. The module 602 mayautomatically assign a person to one of person P₀'s affinity planesbased on a function of the keywords associated with that affinity planeand the content of messages 604 c associated with (e.g., sent and/orreceived by) the person.

Although in the examples above the module 602 associates people withaffinity planes based on the data 604 a, 604 b, and 604 c individually,this is merely an example and does not constitute a limitation of thepresent invention. More generally, the affinity plane module 602 maytake into account any combination of two or more of the data sets 604a-c (e.g., all of the data sets 604 a-c) to assign people to person P₀'saffinity planes. For example, to associate any particular person withone or more of person P₀'s affinity planes, the module 602 may take intoaccount a combination of the person's position in person P₀'s socialnetwork graph as reflected in the friends data 604, the person's contactinformation as reflected in the address book data 604 b, and themessages exchanged by the person with person P₀ as reflected in themessage data 604 c.

Furthermore, the particular data shown in FIG. 6, namely the friendsdata 604 a, address book data 604 b, and message data 604 c, are merelyexamples of data that the affinity plane assignment module 602 mayassign to affinity planes, and do not constitute limitations of thepresent invention. Other examples include, but are not limited to,digital images (including metadata indicating people tagged in thoseimages), documents and other files stored in file systems, web pages andother documents stored online, databases, and any other data storagesystem.

The same or similar techniques as those shown in FIGS. 6 and 7 may beused to automatically assign people to sectors, such as person P₀'ssectors 112 a-c (FIG. 1B). Furthermore, the same or similar techniquesas those shown in FIGS. 6 and 7 may be used to automatically assignresources to affinity planes and sectors (e.g., person P₀'s affinityplanes 102 a-c and sectors 112 a-c). Although the same generaltechniques may be applied to assign both people and resources to bothaffinity planes and sectors, the techniques (and parameters of thosetechniques) may vary from one case to another. For example, althoughtextual content may be analyzed to associate people with affinity planesand to associate resources with affinity planes, different rules may beapplied in each case.

The system 600 may obtain information about a user's resources, forpurposes of automatically assigning those resources to affinity planesand sectors, in any of a variety of ways. For example:

-   -   the user may point the system 600 to individual resources, such        as by browsing to such resources in a file system or otherwise        uploading such resources to the system 600 individually;    -   the user may provide the system 600 with credentials for        securely accessing resources from an account in another system        (such as by providing the system 600 with a username and        password to a social networking account), in response to which        the system 600 may automatically discover resources available        through the specified account;    -   the system 600 may include middleware and/or other components        for communicating automatically with external systems (such as        Facebook or other social networking systems) using technologies        such as APIs, XML, or XMPP, whether or not the user provides the        system for account credentials or connectivity data;    -   the user may provide the system 600 with a URL or other address        at which resources may be accessed, in response to which the        system 600 may automatically discover resources at the specified        location.

Automatic discovery of resources by the system 600 may be accomplished,for example, by the systematic segmenting, parsing, analyzing (e.g.,performing word recognition and/or facial recognition), or otherprocessing of resources. As one particular example, resources may bediscovered from a user's Facebook account by: (1) logging in to theuser's Facebook account using the user-supplied credentials; (2) usingFacebook's public APIs to download the user's friend trees, resourcemaps, privacy settings, post histories, and other documents; and (3)building metadata text documents for each resource, including allassociated tags, people, and other resources.

The system 600 may use any of a variety of techniques to assignresources to affinity planes. In one simple example, the system 600 mayindex text in or otherwise associated with a resource (such as metadataassociated with the resource). The system 600 may then assign theresource to one or more affinity planes based on total frequencythresholds associated with the affinity planes. For example, if a“music” affinity plane is defined by the terms “music,” “band,”“concert,” “gig,” “classical,” and “rock,” and the affinity plane has atotal frequency threshold of 3, then a particular resource may beautomatically assigned to the “music” affinity plane if terms associatedwith the “music” affinity plane occur within the resource at least threetimes in aggregate (where the number of times terms occur may includeonly unique occurrences or include repeat occurrences). For example, ifthe term “band” occurs once in the resource and the term “concert”appears twice in the resource, the aggregate number of occurrences inthe resource of terms defining the “music” affinity plane would bethree, and the resource would be automatically assigned to the “music”affinity plane.

Such threshold-based assignment is merely one example of a way in whichresources may be automatically assigned to affinity planes. Otherexamples of techniques that may be used include classification methods,clustering methods (such as a Ward's method), and k-nearest neighboralgorithms.

Although the system 600 of FIG. 6 and the method 700 of FIG. 7 aredescribed in connection with person P₀, the same or similar techniquesmay be applied to associate people and resources with the affinityplanes and sectors of any additional number of people, e.g., people P₁,P₂, P₃, etc. Each such person may have his or her own affinity planesand sectors (although affinity planes and sectors may be shared amongpeople). Similarly, although the affinity plane assignment module 602may apply distinct rules (or the same rules with different parametervalues) to automatically assign people and resources to the affinityplanes and sectors of different people, the module may apply the samerules (with or without the same parameter values) for any two or morepeople.

The automatic assignment of FIGS. 6 and 7 may be replaced orsupplemented by various techniques for manually assigning people andresources to affinity planes and sectors. For example, referring to FIG.8, a dataflow diagram is shown of a system 800 for enabling a person(e.g., person P₀) to manually associate other people with his or heraffinity planes and sectors according to one embodiment of the presentinvention. Referring to FIG. 9, a flowchart is shown of a method 900that is performed by the system 800 of FIG. 8 according to oneembodiment of the present invention.

The system 800 and method 900 of FIGS. 8 and 9, respectively, may beapplied instead of or in addition to the system 600 and method 700 ofFIGS. 6 and 7, respectively. For example, if person P₀ does not wish tomake use of the automatic assignment of FIGS. 6 and 7, then he or shemay disable such automatic assignment and assign people and resources toaffinity planes and sectors solely manually using the techniques ofFIGS. 8 and 9. As another example, if person P₀ wishes to supplementand/or correct automatic assignment of FIGS. 6 and 7, then he or she mayallow the automatic assignment of FIGS. 6 and 7 to be performed, andthen make manual additions and/or corrections to the results of FIGS. 6and 7 using the techniques of FIGS. 8 and 9. For example, if theautomatic assignment of FIGS. 6 and 7 automatically assign person P₁ toa first one of person P₀'s affinity planes, and person P₀ provides inputindicating that person P₁ should instead be assigned to a second one ofperson P₀'s affinity planes, then the system and method of FIGS. 8 and 9may disassociate the first of person P₀'s affinity planes from person P₁and associate the second of person P₀'s affinity planes with person P.Embodiments of the present invention may then apply such a correction(or any other correction provided by person P₀) to future data withoutrequiring person P₀ to provide further input.

Referring to FIG. 10A, an illustration is shown of a graphical userinterface 1000 that may be used in connection with the system 800 (FIG.8) and method 900 (FIG. 9) to associate people with affinity planes andsectors of person P₀. The example user interface 1000 of FIG. 10Aillustrates person P₀'s in a manner similar to that shown in FIG. 1B.Furthermore, the user interface 1000 of FIG. 10A shows the associationsbetween a person P_(n) and one or more of person P₀'s affinity planesand sectors by showing an icon representing person P_(n), where the iconoverlaps some or all of the affinity planes and sectors associated withperson P_(n).

For example, FIG. 10A shows an icon 1002 a representing a particularperson P. The icon 1002 a may, for example, be a digital image of theface of person P₁, or any other image that may be useful for recognizingthe icon 1002 a as representing person P. The icon 1002 a is shownwithin both affinity plane 102 c (to indicate that person P₁ isassociated with affinity plane 102 c of person P₀) and sector 112 a toindicate that person P₁ is associated with sector 112 a of person P₀.The placement of the icon 1002 a shown in FIG. 10A may be the result ofthe automatic assignment process described above in connection withFIGS. 6 and 7, the result of manual assignment by the person P₀, or acombination thereof.

A user of the system 800 (such as the person P₀) may use the userinterface 1000 to associate additional people with affinity planes andsectors of person P₀, to modify existing relationships between peopleand affinity planes and sectors of person P₀, and to delete suchrelationships. For example, the user interface 1000 also shows icons1002 b, 1002 c, and 1002 d, which may represent additional people P₂,P₃, and P₄, respectively. Such people may, for example, have beenidentified automatically by the process 600 of FIG. 6, such as byidentifying such people from the friends list 604 a, address book 604 b,and/or messages 604 c.

Person P₀ (or another user) may use the user interface 1000 to view,create, and modify associations between people P₂, P₃, and P₄ andaffinity planes 112 a-c and sectors 102 a-c, such as by dragging icons1002 b-d onto the desired affinity planes and sectors. For example,referring to FIG. 10B, person P₀ may move icon 1002 b, such as by usinga mouse or other pointer device to drag icon 1002 b from its startingposition 1004 to a desired ending position 1008 along a path 1006. Inthe particular example of FIG. 10B, the desired ending position 1008 ofthe icon 1002 b is within affinity plane 102 b and sector 112 b.

In response to moving the icon 1002 b to its new position 1008, thesystem 800 may create an association between the person P₂ representedby icon 1002 b and affinity plane 102 b and sector 112 b. Morespecifically, the system 800 may include a user-defined associationmodule 802, the purpose of which is to enable users to defineassociations between people and affinity planes/sectors, andassociations between resources and affinity planes/sectors.

The module 802 receives input 804 specifying an association of a personwith an affinity plane of another person (FIG. 9, operation 902). Thedrag input shown in FIG. 10B is an example of the input 804 in FIG. 8.The module 802 creates, based on the input 804, the specifiedassociation between the person and the affinity plane (FIG. 9, operation904). The module 802 may store data representing such an association inaffinity plane-person association data 806 a (an example of which isaffinity plane-person association data 302 in FIG. 3A).

The module 802 receives input specifying an association of the personwith a sector of the other person (FIG. 9, operation 906). The draginput shown in FIG. 10B is an example of the input received in operation906 of FIG. 9. As this example illustrates, a single input may specifyboth one or more affinity planes and one or more sectors. The module 802creates, based on the input 804, the specified association between theperson and the sector (FIG. 9, operation 908). The module 802 may storedata representing such an association in sector-person association data806 b (an example of which is sector-person association data 312 in FIG.3B).

The user interface 1000 may be used to create, modify, and delete anynumber of associations in the manner described above. For example, theuser may modify an existing association by moving an icon from oneposition to another (e.g., by moving icon 1002 b from position 1008 to aposition within a different affinity plane and/or sector in the userinterface 1000). As another example, the user may delete an existingassociation with a person by moving the person's icon out of an existingaffinity plane and/or sector, and delete all existing associations withthe person by moving the person's icon so that it is no longer withinany affinity plane or sector. As yet another example, the user interface1000 may be used to create or delete associations in bulk, such as bydeleting all associations or all associations satisfying some criterion(such as all associations with a particular specified company).

As mentioned above, a single person may be associated with multipleaffinity planes of another person. Similarly, a single person may beassociated with multiple sectors of another person. Such associationsmay be displayed, e.g., using the user interface 1000, in any of avariety of ways. For example, a person's icon may be stretched,repeated, magnified, or otherwise enlarged so that it is containedwithin or otherwise overlaps with multiple affinity planes/sectors toindicate that the person is associated with the multiple affinityplanes/sectors. As another example, selecting a person's icon (e.g., byclicking on or hovering over the icon) may cause the system 800 tovisually indicate the affinity planes, sectors, people, or resourcesassociated with the person, such as by displaying all such affinityplanes, sectors, people, or resources in a single color, by changing avisual characteristic of such affinity planes, sectors, people, orresources (e.g., hue, brightness, transparency), by animating suchaffinity planes, sectors, people, or resources, or by otherwiseemphasizing such affinity planes, sectors, people, or resources.

The system 800 may enable users to specify associations between a singleperson and multiple affinity planes/sectors in any of a variety of ways.For example, when a user moves a person's icon into a particularaffinity plane, the system 800 may by default associate the person onlywith that affinity plane. When a user moves a person's icon into aparticular sector, the system 800 may by default associate the personwith that sector in all affinity planes. These default rules are merelyexamples. The system administrator and/or user may define other defaultrules to be applied in such cases.

One way in which the system 800 may enable a user to indicate that aperson should be associated with multiple affinity planes/sectors is toenable the user to expand the person's icon across the multiple affinityplanes/sectors. As another example, the system 800 may enable the userto make multiple copies of the person's icon and to position thosecopies within each of the desired affinity planes/sectors. As anotherexample, the system 800 may enable the user to place the person's iconinto a single affinity plane and sector, but then to execute othercommands to select additional affinity planes/sectors with which toassociate the person (e.g., by clicking a mouse cursor on the otheraffinity planes/sectors).

In addition to or instead of such techniques, the system 800 may applyrules to create, modify, or delete associations between people andaffinity planes/sectors. Such rules may include system rules and rulesdefined by individual users. For example, person P₀ may define rulesthat the system 800 applies only to associations between other peopleand person P₀'s affinity planes/sectors, while person P₁ may define adifferent set of rules that the system 800 applies only to associationsbetween other people and person P₁'s affinity planes/sectors. The system800 may, in such a case, still apply a single set of system-applicablerules to both person P₀ and person P.

An example of such a rule is the following: if an association is createdbetween person P_(n) and a sector of person P₀, then the associationspans all affinity planes of person P₀. Another example of such a ruleis the following: if an association is created between person P_(n) andan affinity plane A_(m) of person P₀, then the association spans allaffinity planes of person P₀ that contain affinity plane A_(m). Forexample, returning to FIG. 10A, if an association is created by placingicon 1002 b into affinity plane 102 a, then this association may spanboth affinity plane 102 a and enclosing affinity planes 102 b and 102 c.Conversely, if an association is created between a resource and anaffinity plane 102 c, then this association may span both affinity plane102 c and all of the affinity planes enclosed by it (i.e., affinityplanes 102 a-b). Such spanning of affinity planes may be implemented ina variety of ways, such as by creating distinct associations for each ofthe affinity planes 102 a, 102 b, and 102 c, or by applying the ruledynamically whenever the associations are retrieved. In the latter case,if person P₀ adds an additional affinity plane 102 d that enclosedaffinity plane 102 c, then the person associated with icon 1002 b willautomatically be associated with the new affinity plane 102 d.

Although in the examples described above, affinity planes overlap (e.g.,enclose) each other, this is merely an example and does not constitute alimitation of the present invention. For example, any two of a person'saffinity planes may partially overlap each other, without either fullyenclosing the other. As another example, any two of a person's affinityplanes may be disjoint. As a result, a user may have two or more“parallel universes” of affinity planes and sectors, such as one that isdedicated to business relationships and another that is dedicated topersonal relationships. Each such universe may be disjoint from theother, or overlap to any degree.

Although the example of FIGS. 8-10 is shown as applying specifically topeople, the same or similar techniques may be used to create, modify,and delete associations between resources and affinity planes/sectors.For example, the graphical user interface 1000 (or another graphicaluser interface) may display icons representing individual resources. Auser (e.g., person P₀) may drag those icons into affinity planes/sectorsand thereby cause the system 800 to create associations between thecorresponding resources and the specified affinity planes/sectors in themanner described above. Icons representing both people and resources,and the affinity planes/sectors with which they are associated, may bedisplayed simultaneously within the same user interface 1000, therebyfacilitating the user's understanding of the relationship between personP₀ and his or her resources, connections (related people), affinityplanes, and sectors.

Although the examples of FIGS. 6-10 are described above as illustratingtechniques for granting resource access to people, the same or similartechniques may be used, additional or alternatively, to restrict or denyresource access to people. For example, the techniques of FIGS. 6-10 maybe used to explicitly grant resource access to certain people and, bynegative implication, to deny resource access to other people who havenot expressly been granted access. As another example, the techniques ofFIGS. 6-10 may be used to explicitly restrict or deny access to certainpeople. For example, the automatic assignment system 600 of FIG. 6 maybe used to automatically deny access by certain people to one or moreaffinity planes and/or one or more sectors of another person. Similarly,the manual assignment system 800 of FIG. 8 may be used to enable aperson to manually deny access by certain people to one or more affinityplanes and/or one of more sectors of that person. For example, the userinterface 1000 of FIGS. 10A-10B may be used to manually specify affinityplanes and/or sectors to which specified people should be denied access.

The particular user interfaces shown in FIGS. 10A-10B are merelyexamples and do not constitute limitations of the present invention.FIG. 10C shows another example user interface 1010 that may be used toassign resources of a particular person P₀ to that person's affinityplanes. The user interface 1010 includes circles 1020 a-e, each of whichrepresents a different type of resource of person P₀, namely socialnetworking sites 1020 a, people 1020 b, photos 1020 c, videos 1020 d,and documents 1020 e. These particular types of resource are merelyexamples and do not constitute limitations of the present invention. Thesize of each of the circles 1020 a-e corresponds to the number ofresources in the corresponding category.

The user interface 1010 also includes circles 1030 a-e, each of whichrepresents a different affinity plane of person P₀, namely a familyaffinity plane 1030 a, a fine art affinity plane 1030 b, an educationaffinity plane 1030 c, a music affinity plane 1030 d, and a workaffinity plane 1030 e. These particular affinity planes are merelyexamples and do not constitute limitations of the present invention. Thesize of each of the circles 1030 a-e may, for example, correspond to thenumber of resources in the corresponding affinity plane, the importance(e.g., weight and/or rank) of the affinity plane, or a combinationthereof. Each of the circles 1030 a-e, in other words, is a graphicalrepresentations of one of person P₀'s affinity planes.

It should be appreciated that embodiments of the present invention maygenerate the user interface 1010 of FIG. 10C in a variety of ways. Forexample, for each of a plurality of affinity planes of person P₀,embodiments of the present invention may: (1) select a location at whichto display a graphical representation of the affinity plane; and (2)display the graphical representation of the affinity plane at theselected location. Graphical representations of different affinityplanes may be displayed at different locations. The distance between anypair of graphical representations may be based on the number ofresources and/or people in common between the affinity planesrepresented by the pair of graphical representations. As thisdescription implies, and as illustrated by the example of FIG. 10C, theresulting user interface may include graphical representations ofaffinity planes (e.g., circles) that are separated from each other bymultiple distances that differ from each other.

Embodiments of the present invention may represent characteristics ofaffinity planes using graphical features instead of or in addition tosize, such as color and/or shape. For example, for each of a pluralityof affinity planes of person P₀, embodiments of the present inventionmay: (1) identify a value of a characteristic of the affinity plane; (2)select a graphical feature based on the value of the characteristic ofthe affinity plane; and (3) render a graphical representation of theaffinity plane to have the selected graphical feature. Examples ofcharacteristics are the number of people associated with an affinityplane, the number of resources associated with an affinity plane, andthe current activity level associated with an affinity plane. Such acharacteristic may have one value (e.g., 10) for one affinity plane anda different value (e.g., 20) for another affinity plane. Examples ofgraphical features are size, shape, and color. As a result, affinityplanes having different values of the same characteristic may berendered using different graphical features, such as different sizes,shapes, or colors.

The user (e.g., person P₀ or another person) may use the interface 1010to assign resources to affinity planes in any of a variety of ways. Ingeneral, the user may drag one of the resource circles 1020 a-e onto oneof the affinity plane circles 1030 a-e to assign the correspondingresources to the corresponding affinity plane. If the user wishes toassign only a subset of the resources corresponding to a particular oneof the circles 1020 a-e to an affinity plane, the user may select acircle (e.g., by clicking on or hovering over the circle), therebycausing the user interface 1010 to display a list of subsets of theselected resource, as in the example of resource subset list 1022, whichcontains descriptions of subsets of the photo resources 1020 c (namely,educational summit photos 1024 a, college pictures 1024 b, my kids'pictures 1024 c, and work event pictures 1024 d). The user may selectone of the subsets from the list 1022, thereby causing the userinterface 1010 to assign only the selected subset of photos to theselected affinity plane.

Once a person's connections and resources have been associated with theperson's affinity planes and sectors (whether automatically, manually,or both), embodiments of the present invention may be used to grant ordeny access to those resources by other people based on theassociations. Before explaining how such access control may beimplemented, ways in which the associations among connections (people),resources, affinity planes, and sectors may be implemented will bedescribed.

For example, referring to FIG. 2, an example of a system 200 implementedaccording to one embodiment of the present invention is shown. Thesystem 200 includes affinity plane data 202 representing affinity planesof users of the system 200. For purposes of example, the affinity planedata 202 includes affinity plane data 204 a for person P₀, affinityplane data 204 b for a second person P₁, and affinity plane data 204 cfor a third person P₀. The number of users and affinity planesillustrated in FIG. 2 is merely an example and does not constitute alimitation of the present invention, which may be applied to any numberof users, each of whom may have any number of affinity planes.

In the particular example of FIG. 2, person P₀'s affinity plane data 204a includes first affinity plane definition data 206 a defining a firstone of person P₀'s affinity planes (e.g., affinity plane 102 a in FIG.1A), second affinity plane definition data 206 b defining a second oneof person P₀'s affinity planes (e.g., affinity plane 102 b in FIG. 1A),and third affinity plane definition data 206 c defining a third one ofperson P₀'s affinity planes (e.g., affinity plane 102 b in FIG. 1A).Similarly, person P₁'s affinity plane data 204 b includes first affinityplane definition data 208 a defining a first one of person P₁'s affinityand second affinity plane definition data 208 b defining a second one ofperson P₁'s affinity planes. Finally, person P₂'s affinity plane data204 c includes first affinity plane definition data 210 a defining afirst one of person P₂'s affinity planes.

As FIG. 2 illustrates, the term “a person's affinity planes” may referto any affinity planes that are associated with that person by the useof suitable data. Any reference herein to a particular person “having”affinity planes or to the affinity planes “of” a particular personshould be understood to refer to the particular person's affinityplanes. For example, reference herein to “person P₀'s affinity planes”or to the fact that “person P₀ has three affinity planes” or to the“affinity planes of person P₀” should be understood to refer to theperson P₀'s affinity planes as defined by the affinity plane data 204 ain FIG. 2. As further illustrated by FIG. 2, different people may havedifferent affinity planes, and different people may have differentnumbers of affinity planes.

For example, referring again to FIG. 2, the system 200 includes sectordata 222 representing sectors of users of the system 200. For purposesof example, the sector data 222 includes sector data 224 a for personP₀, sector data 224 b for second person P₁, and sector data 224 c forthird person P₀. The number of sectors illustrated in FIG. 2 is merelyan example and does not constitute a limitation of the presentinvention, which may be applied to users having any number of sectors.

In the particular example of FIG. 2, person P₀'s sector data 224 aincludes first sector definition data 226 a defining a first one ofperson P₀'s sectors (e.g., sector 112 a in FIG. 1B), second sectordefinition data 226 b defining a second one of person P₀'s sectors(e.g., sector 112 b in FIG. 1B), and third sector definition data 226 cdefining a third one of person P₀'s sectors (e.g., sector 102 c in FIG.1B). Similarly, person P₁'s sector data 204 b includes first sectordefinition data 228 a defining a first one of person P₁'s sectors.Finally, person P₂'s sector data 224 c includes first sector definitiondata 230 a defining a first one of person P₂'s sectors and second sectordefinition data 230 b defining a second one of person P₂'s sectors.

As FIG. 2 illustrates, the term “a person's sectors” may refer to anysectors that are associated with that person by the use of suitabledata. Any reference herein to a particular person “having” sectors or tothe sectors “of” a particular person should be understood to refer tothe particular person's sectors. For example, reference herein to“person P₀'s sectors” or to the fact that “person P₀ has three sectors”or to the “sectors of person P₀” should be understood to refer to theperson P₀'s sectors as defined by the sector data 224 a in FIG. 2. Asfurther illustrated by FIG. 2, different people may have differentsectors, and different people may have different numbers of sectors.

As illustrated in FIG. 1B, a sector need not cut across (overlap) allaffinity planes. For example, although sector 112 a overlaps all ofperson P₀'s affinity planes, sector 112 b overlaps only affinity planes102 b and 102 c, but not affinity plane 102 a. As another example,sector 112 c overlaps only affinity plane 102 a but not affinity planes102 b or 102 c. The extent to which a particular sector of a particularperson overlaps that person's affinity planes may be specified withinthe sector definition data for that sector. For example, each instanceof sector definition data may have an “associated affinity planes” fieldwhich specifies the affinity plane(s), if any, that overlap with thecorresponding sector. Such a field may, for example, specify a list ofaffinity planes or specify the associated affinity plane(s) in a moregeneral way, such as by using a filter specifying one or more criteria,or a label such as “All” or “None.” For example, the sector definitiondata 226 a for sector 112 a may contain a value of “all” to specify thatthe sector 112 a overlaps all of person P₀'s affinity planes; the sectordefinition data 226 b for sector 112 b may contain a value of {2, 3} tospecify that the sector 112 b overlaps only affinity planes 102 b and102 c; and the sector definition data 226 c for sector 112 c may containa value of {1} to specify that the sector 112 c overlaps only affinityplane 112 c.

As mentioned above, people may be associated with other people'saffinity planes. This is one way in which embodiments of the presentinvention may be used to control access to a person's resources. Forexample, if a second person P₁ is associated with person P₀'s affinityplane 102 c but not with person P₀'s affinity planes 102 a-b, this maybe taken into account when deciding whether to grant person P₁ withaccess to person P₀'s resources. Ways in which the association of peoplewith other people's affinity planes may be used to grant or denyresource access requests will be described in more detail below.

In general, any particular person may be associated with zero, one, ormore of another person's affinity planes. For example, referring to FIG.3A, an example is shown of affinity plane person association data 302according to one embodiment of the present invention. In general, thedata 302 specifies, for each of a plurality of people (e.g., people P₀,P₁, and P₂), the other people who are associated with their affinityplanes.

More specifically, affinity plane person association data 302 includesdata 304 a, 304 b, and 304 c, corresponding to people P₀, P₁, and P₂,respectively. For example, affinity plane person association data 304 aspecifies which other people are associated with person P₀'s affinityplanes, affinity plane person association data 304 b specifies whichother people are associated with person P₁'s affinity planes, andaffinity plane person association data 304 c specifies which otherpeople are associated with person P2's affinity planes. Morespecifically, person P₀'s affinity plane person association data 304 aincludes data 306 a, which specifies which other people are associatedwith affinity plane 102 a, data 306 b, which specifies which otherpeople are associated with affinity plane 102 b, and data 306 c, whichspecifies which other people are associated with affinity plane 102 c.Person P₁'s affinity plane person association data 304 b includes data308 a, which specifies which other people are associated with a firstone of person P₁'s affinity planes, and data 308 b, which specifieswhich other people are associated with a second one of person P₁'saffinity planes. Finally, person P₂'s affinity plane person associationdata 304 c includes data 310 a, which specifies which other people areassociated with a first one of person P₂'s affinity planes.

As mentioned above, people may be associated with other people'ssectors. This is one way in which embodiments of the present inventionmay be used to control access to a person's resources. For example, if asecond person P₁ is associated with person P₀'s sector 112 c but notwith person P₀'s sectors 112 a-b, this may be taken into account whendeciding whether to grant person P₀ with access to person P₀'sresources. Ways in which the association of people with other people'ssectors may be used to grant or deny resource access requests will bedescribed in more detail below.

In general, any particular person may be associated with zero, one, ormore of another person's sectors. For example, referring to FIG. 3B, anexample is shown of sector-person association data 312 according to oneembodiment of the present invention. In general, the data 312 specifies,for each of a plurality of people (e.g., people P₀, P₁, and P₂), theother people who are associated with their sectors.

More specifically, sector-person association data 312 includes data 314a, 314 b, and 314 c, corresponding to people P₀, P₁, and P₂,respectively. For example, sector-person association data 314 aspecifies which other people are associated with person P₀'s sectors,sector-person association data 314 b specifies which other people areassociated with person P₁'s sectors, and sector-person association data314 c specifies which other people are associated with person P₂'ssectors. More specifically, person P₀'s sector-person association data314 a includes data 316 a, which specifies which other people areassociated with sector 112 a, data 316 b, which specifies which otherpeople are associated with sector 112 b, and data 316 c, which specifieswhich other people are associated with sector 112 c. Person P₁'ssector-person association data 314 b includes data 318 a, whichspecifies which other people are associated with a first one of personP₁'s sectors. Finally, person P₂'s sector-person association data 314 cincludes data 320 a, which specifies which other people are associatedwith a first one of person P₂'s sectors, and data 320 b, which specifieswhich other people are associated with a second one of person P₂'ssectors.

Although the affinity plane association data 302 of FIG. 3A and thesector association data 312 of FIG. 3B are shown as distinct data inFIGS. 3A and 3B, this is merely an example and does not constitute alimitation of the present invention. The data 302 and 312 may becombined together and/or divided in any of a variety of ways.

As mentioned above, a person may have zero or more resources. Forexample, referring to FIG. 1C, a diagram is shown which illustratesresources of first person P₀. In the particular example of FIG. 1C,person P₀ has eight resources 122 a-h. The particular number ofresources shown in FIG. 1C, however, is merely an example and does notconstitute a limitation of the present invention. More generally,embodiments of the present invention may be used in connection withpeople having any number of resources (including zero resources).Furthermore, as will be described in more detail below, different peoplemay have different numbers of resources.

As FIG. 1C illustrates, a resource may contain zero or more otherresources, to any level of nesting. For example, in FIG. 1C, resource122 c contains resources 122 d and 122 e, as in the case of a web sitethat contains multiple web pages. As another example, resource 122 fcontains resource 122 g, which contains resource 122 h, as in the caseof a database, which contains a table, which contains a record. As theseexamples illustrate, a particular person may have different resources ofdifferent types.

FIG. 1C merely provides a visual representation of the resources 122 a-hfor ease of illustration and explanation. The circles that are used torepresent the affinity planes 122 a-h in FIG. 1C, therefore, are not theresources themselves but rather merely one way in which the resources122 a-h may be displayed graphically. More generally, resources may bedisplayed and otherwise manifested in any of a variety of ways.Furthermore, resources may be represented and stored using any of avariety of data structures.

Referring again to FIG. 2, the system 200 further includes resource data242 representing resources of users of the system 200. For purposes ofexample, the resource data 242 includes resource 244 a for person P₀,resource data 244 b for person P₁, and resource data 244 c for personP₂.

In the particular example of FIG. 2, person P₀'s resource data 244 aincludes resource data 246 a-h, which represent person P₀'s resources(e.g., resources 122 a-h in FIG. 1C); person P₁'s resource data 244 bincludes resource data 248 a-b, which represent person P₁'s resources;and person P₂'s resource data 244 c includes resource data 250 a, whichrepresents person P₂'s resources. The particular number of resourcesshown in FIG. 2 is merely an example and does not constitute alimitation of the present invention.

The resource data 242 may represent the corresponding resources in anyof a variety of ways, such as by including any one or more of thefollowing: copies of the corresponding resources, references to thecorresponding resources (e.g., URLs, pointers, or array indices), andsummaries of the corresponding resources. The resources of differentpeople may intersect. For example, resource data 246 a of person P₀ mayrepresent the same resource (e.g., document) as resource data 248 a ofperson P.

As FIG. 2 illustrates, the term “a person's resources” may refer to anyresources that are associated with that person by the use of suitabledata. Any reference herein to a particular person “having” or “owning”resources or to the resources “of” a particular person should beunderstood to refer to the particular person's resources. For example,reference herein to “person P₀'s resources” or to the fact that “personP₀ has eight resources” or to the “resources of person P₀” should beunderstood to refer to the person P₀'s resources as defined by theresource data 244 a in FIG. 2. As further illustrated by FIG. 2,different people may have different resources, and different people mayhave different numbers of resources. Although in some cases a person maybe said to have a resource as a result of owning, having control over,or having created that resource, none of these are requirements of thepresent invention. Therefore, any references to the “owner” of aresource do not require legal ownership of the resource by the owner.

In general, any particular resource may be associated with zero, one, ormore of another person's affinity planes. For example, referring to FIG.3C, an example is shown of affinity plane-resource association data 352according to one embodiment of the present invention. In general, thedata 352 specifies, for each of a plurality of people (e.g., people P₀,P₁, and P₂), the resources that are associated with their affinityplanes.

More specifically, affinity plane-resource association data 352 includesdata 354 a, 354 b, and 354 c, corresponding to people P₀, P₁, and P₂,respectively. For example, affinity plane-resource association data 354a specifies which resources are associated with person P₀'s affinityplanes, affinity plane-resource association data 354 b specifies whichresources are associated with person P₁'s affinity planes, and affinityplane-resource association data 354 c specifies which resources areassociated with person P2's affinity planes. More specifically, personP₀'s affinity plane-resource association data 354 a includes data 356 a,which specifies which resources are associated with affinity plane 102a; data 356 b, which specifies which resources are associated withaffinity plane 102 b; and data 356 c, which specifies which resourcesare associated with affinity plane 102 c. Person P₁'s affinityplane-resource association data 354 b includes data 358 a, whichspecifies which resources are associated with a first one of person P₁'saffinity planes; and data 358 b, which specifies which resources areassociated with a second one of person P₁'s affinity planes. Finally,person P₂'s affinity plane-resource association data 354 c includes data360 a, which specifies which resources are associated with a first oneof person P₂'s affinity planes.

As mentioned above, resources may be associated with a person's sectors.This is one way in which embodiments of the present invention may beused to control access to a person's resources. For example, if a secondperson P₁ who associated with person P₀'s sector 112 c but not withperson P₀'s sectors 112 a-b requests access to a resource that isassociated with person P₀'s sectors 112 a-b but not with sector 112 c,this may be taken into account when deciding whether to grant person P₁with access to the resource. Ways in which the association of peoplewith other people's sectors may be used to grant or deny resource accessrequests will be described in more detail below.

In general, any particular resource may be associated with zero, one, ormore of a person's sectors. For example, referring to FIG. 3D, anexample is shown of sector-resource association data 362 according toone embodiment of the present invention. In general, the data 362specifies, for each of a plurality of people (e.g., people P₀, P₁, andP₂), the other people who are associated with their sectors.

More specifically, sector-resource association data 362 includes data364 a, 364 b, and 364 c, corresponding to people P₀, P₁, and P₂,respectively. For example, sector-resource association data 364 aspecifies which resources are associated with person P₀'s sectors,sector-resource association data 364 b specifies which resources areassociated with person P₁'s sectors, and sector-resource associationdata 364 c specifies which resources are associated with person P₂'ssectors. More specifically, person P₀'s sector-resource association data364 a includes data 366 a, which specifies which resources areassociated with sector 112 a; data 366 b, which specifies whichresources are associated with sector 112 b; and data 366 c, whichspecifies which resources are associated with sector 112 c. Person P₁'ssector-resource association data 364 b includes data 368 a, whichspecifies which resources are associated with a first one of person P₁'ssectors. Finally, person P₂'s sector-resource association data 364 cincludes data 370 a, which specifies which resources are associated witha first one of person P₂'s sectors; and data 370 b, which specifieswhich resources are associated with a second one of person P₂'s sectors.

Although the sector association data 352 of FIG. 3C and the sectorassociation data 362 of FIG. 3D are shown as distinct data in FIGS. 3Cand 3D, this is merely an example and does not constitute a limitationof the present invention. The data 352 and 312 may be combined togetherand/or divided in any of a variety of ways.

Furthermore, the various data of FIGS. 3A-3D may be represented in otherways that will be apparent to those having ordinary skill in the art.For example, the data in FIGS. 3A-3D are illustrated as beingperson-centric, i.e., as storing data in relation to individual people.As another example, the data in FIGS. 3A and 3C are illustrated as beingaffinity plane-centric, i.e., as storing data in relation to affinityplanes. As another example, the data in FIGS. 3B and 3D are illustratedas being sector-centric, i.e., as storing data in relation to sectors.All of these are merely examples and do not constitute limitations ofthe present invention. Alternatively or additionally, for example, datashown in FIGS. 3A-3D may be stored in a resource-centric way, e.g., byrepresenting, for each resource, the people, affinity planes, and/orsectors associated with that resource.

The affinity plane-person association data 302 of FIG. 3A and thesector-person association data 312 of FIG. 3B may specify the peopleassociated with affinity planes and sectors, respectively, in any of avariety of ways, such as by using an individual identifier for eachperson (e.g., real name or email address), or by defining criteria thatare satisfied by the associated people. Similarly, the affinityplane-resource association data 352 of FIG. 3C and the sector-resourceassociation data 362 of FIG. 3D may specify the resources associatedwith affinity planes and sectors, respectively, in any of a variety ofways, such as by using an individual identifier for each resource (e.g.,URL or filename), or by defining criteria that are satisfied by theassociated resources.

As described above, people may be associated with affinity planes and/orsectors. People who themselves do not have any affinity planes and/orsectors, however, may be associated with the affinity planes and/orsectors of other people. For example, if the techniques disclosed hereinare implemented in a computer system in which people P_(c), P₁, and P₂are users of the system and have their own affinity planes and sectors,other people who are not users of the system may nonetheless beassociated with affinity planes and/or sectors of users P₀, P₁, and P₂.

In the particular examples described above, affinity planes areillustrated as circles and sectors are illustrated as wedges or partialwedges within those circles. Consider, for example, the wedge thatrepresents sector 112 a in FIG. 1B. The portion this wedge that fallswithin affinity plane 102 c represents all of person P₀'s resources thatare associated with affinity plane 102 c and sector 112 a. Embodimentsof the present invention may, however, be used to associate resourceswith less than all of the overlap between a particular affinity planeand sector. In general, a resource may be associated with any portion ofan affinity plane and any portion of a sector.

As mentioned above, embodiments of the present invention may be used tocontrol access to resources associated with people. In general,embodiments of the present invention may, for example, respond to arequest by one person (e.g., person P₁) to access one or more resourcesof another person (e.g., person P₀). The access request may specify theresource(s) for which access is requested at any level of generality.For example, the access request may request access to a single specifiedresource (e.g., using a URL or filename and path) or to multipleresources. In the latter case, the access request may specify therequested resources in any of a variety of ways, such as by specifyingone or more affinity planes, sectors, categories (e.g., music, business,sports), keywords, addresses (e.g., URLs or file paths), regularexpressions, or search queries expressed in a natural language or formallanguage (e.g., SQL).

In the most general case, the access request may request access to allof a particular person's resources, in response to which an embodimentof the present invention may provide the requestor with access only tothose resources which the requestor is entitled to access, in accordancewith the techniques described below.

For example, referring to FIG. 4, a dataflow diagram is shown of asystem 400 for processing resource access requests according to oneembodiment of the present invention. Referring to FIG. 5, a flowchart isshown of a method 500 performed by the system 400 of FIG. 4 according toone embodiment of the present invention.

The system 400 includes an access control module 408. A requestor 402provides a resource access request 404 to the access control module 408,which receives the request 404 (FIG. 5, operation 502). In general, therequest 404 contains data that specifies a request to access one or moreresources of a person. For purposes of example in the followingdiscussion, assume that the request 404 requests access to a singleresource 122 b of person P₀. The requestor 402 may, for example, be aperson other than person P₀ or a machine or computer program. Thetechniques of FIGS. 4 and 5 may, however, be repeated as necessary toprocess multiple requests to access a single resource of person P₀, orto process a single request to access multiple resources of person P₀.

The resource access request 404 may include or otherwise specify (e.g.,define or point to) a variety of data that may be used in the process ofdetermining whether to grant the resource access request 404. Forexample, the resource access request may include one or more of thefollowing: resource owner data 406 a, which identifies an owner of therequested resource; a resource identifier (ID) 406 b, which identifiesthe requested resource; and a requester identifier (ID) 406 c, whichidentifies the requestor 402. The elements 406 a-c shown in FIG. 4 aremerely examples and do not constitute limitations of the presentinvention.

The access control module 408 identifies the requested resource, such asby using the resource ID 406 b (FIG. 5, operation 504). The accesscontrol module 408 identifies the owner of the requested resource, suchas by using the resource ID 406 b and/or the resource owner ID 406 a(FIG. 5, operation 506). The access control module 408 obtains resourceassociation data 412, which specifies the affinity planes and/or sectorsof the resource owner (if any) with which the requested resource isassociated (FIG. 5, operation 508). The access control module 408 may,for example, obtain the resource association data 412 by analyzing theaffinity plane-resource association data 352 (FIG. 3C) and thesector-resource association data 372 (FIG. 3D).

The access control module 408 obtains requester association data 410,which specifies the affinity planes and/or sectors of the resource owner(if any) with which the requester is associated (FIG. 5, operation 510).The access control module 408 may, for example, obtain the requesterassociation data 410 by analyzing the affinity plane-person associationdata 302 (FIG. 3A) and the sector-person association data 322 (FIG. 3B).

The access control module 408 determines whether to grant the resourceaccess request 404 based on the resource association data 412 and therequester association data 410. In particular, the access control module408 may grant the request 404 only if the requester 402 is associatedwith one or more affinity planes of the resource owner that sufficientlyoverlap with one or more affinity planes associated with the requestedresource (FIG. 5, operations 512, 514, and 516). Otherwise, the accesscontrol module 408 may deny the request 404 (FIG. 5, operations 512,514, and 518). In either case, the access control module 408 maygenerate a resource access response 414 representing the outcome of thedecision to grant or deny the request 404. The access control module 408may provide the response 414 to the requester 402 in any of a variety ofways. For example, the response 414 may include a message informing therequestor 402 of the decision. As another example, if the response 414represents a decision to grant the request 404, the response 414 mayinclude a copy of or reference to the requested resource.

The overlap determinations in operations 512 and 514 of FIG. 5 may beperformed in any of a variety of ways. For example, the overlapdetermination in operation 512 may be satisfied only by complete overlapof all requester-associated affinity planes with all resource-associatedaffinity planes. Similarly, the overlap determination in operation 514may be satisfied only by complete overlap of all requester-associatedsectors with all resource-associated sectors. Alternatively, forexample, overlap may be considered to be sufficient if the overlapexceeds some predetermined percentage or satisfies some otherpredetermined criteria.

As mentioned above, a resource access request may request access to aplurality of person P₀'s resources. In response to such a request, thesystem 400 of FIG. 4 and method 500 of FIG. 5 may loop over all of therequested resources, and grant or deny access to each such resource inaccordance with the method 500 of FIG. 5. For example, embodiments ofthe present invention may provide person P₀ with a personalizedgraphical user interface (GUI) which may display information aboutresources accessible to the person to whom the GUI is displayed at anyparticular point in time. The personalized GUI may, for example, takethe form of a web page accessible via a particular URL or associatedwith a particular user account in an online system. When another user P₁requests that person P₀'s GUI be displayed (such as by navigating toperson P₀'s personalized home page), the request to retrieve thepersonalized GUI may be treated by the system 400 and method 500 as arequest by user P₁ to access and view all of user P₀'s resources, or atleast to access and view some of user P₀'s resources as dictated by thelayout of the home page. In response, the system 400 and method 500 maydisplay, via the personalized GUI, representations of only thoseresources of person P₀ which person P₁ is entitled to access inaccordance with the system 400 and method 500.

An example of such a personalized GUI 1100 is shown in FIG. 11. The GUI1100 includes text 1102 representing the name of the person P₀associated with the home page, a photos areas 1104, a posts area 1108,and a friends area 1112. The particular set of areas shown in FIG. 11and the layout of such areas is merely an example and does notconstitute a limitation of the present invention. In general, photosarea 1104 displays photos of person P₀ which person P₁ is entitled toaccess, posts area 1108 displays posts of person P₀ which person P₁ isentitled to access, and friends area 1112 displays images of friends ofperson P₀ which person P₁ is entitled to access. In the particularexample of FIG. 1100, photos area 1104 includes four photos 1106 a-d(which may contain fewer than all of person P₀'s photos), posts area1108 includes five posts 1110 a-e (which may contain fewer than all ofperson P₀'s posts), and friends area 1112 includes four friend images1114 a-d (which may contain images of fewer than all of person P₀'sfriends).

The GUI 1100 is “personalized” in the sense that it has been filtered bythe system 400 and method 500 to display to person P₁ only thoseresources of person P₀ that person P₁ is entitled to access. If adifferent person P₂ were to navigate to person P₀'s home page, thesystem 400 and method 500 would identify person P₂ and, based on personP₂'s identity, apply the method 400 and system 500 to produce apersonalized GUI of person P₀ that has the same form as the GUI 1100 ofFIG. 11 but that may differ in content from the GUI 1100 of FIG. 11. Inparticular, the personalized GUI displayed to person P₂ would displayonly those resources of person P₀ (e.g., photos, posts, and friends)that person P₂ is entitled to access, which may differ from theresources of person P₀, shown in FIG. 11, that person P₁ is entitled toaccess. The system 400 and method 500, in other words, may customize thecontent displayed in person P₀'s GUI to any particular person bytailoring that content based on the access rights of that person inrelation to person P₀.

As described above, multiple people may each have their own affinityplanes, sectors, and resources. Although the description above focusesprimarily on person P₀ and the associations of other people with personP₀'s affinity planes and sectors, this is merely an example and does notconstitute a limitation of the present invention. The techniquesdisclosed herein may be applied to the affinity planes, sectors, andresources of multiple people (e.g., people P₁ and P₂ in the examplesherein) and to the associations of other people with those affinityplanes and sectors. As a result, when the system 400 of FIG. 4 and thesystem 500 of FIG. 5 are applied to requests to access the resources ofother people, the particular relationships of the requestor to theaffinity planes and sectors of the resource owner will be taken intoaccount by the system 400 and method 500 to determine whether to grantthose requests.

One consequence of this is that a request by one person (e.g., personP₁) to access a particular resource of another person (e.g., person P₀)may be granted by the system 400 and method 500 based on the particularassociations of person P₁ and the requested resource with the affinityplanes and sectors of the resource owner P₀, while a request by the sameperson P₁ to access the same or similar resource of another person(e.g., person P₂) may be denied by the system 400 and method 500 basedon the particular associations of person P₁ and the requested resourcewith the affinity planes and sectors of the other resource owner P₂. Asthis example makes clear, embodiments of the present invention determinewhether to grant resource access requests based on the particular web ofassociations between the requestor and the resource owner's affinityplanes, sectors, and resources.

Embodiments of the present invention enable resource owners to limit thetimes during which others may access those resources. Such temporalrestrictions on resource access may be implemented in a variety of ways.For example, any affinity plane may be associated with an accessibilitytime period, which may, for example, be represented by data within theaffinity plane's definition in the affinity plane data 202 (FIG. 2).Similarly, any sector may be associated with an accessibility timeperiod, which may, for example, be represented by data within thesector's definition in the sector data 222 (FIG. 2).

An accessibility time period may define times during which thecorresponding affinity plane or sector is accessible to others in any ofa variety of ways, such as by specifying a start time and an end time, astart time and a duration, or a definition of a recurring time period(e.g., daily from 9 am-5 pm, on weekdays after 6 pm). As anotherexample, the start time of an accessibility time period may be derivedfrom the start time of an event (such as the beginning of a project).Similarly, the end time of an accessibility time period may be derivedfrom the end time of an event. Different affinity planes may share acommon accessibility time period or have distinct accessibility timeperiods. Similarly, different sectors may share a common accessibilitytime period or have distinct accessibility time periods. Any techniquedescribed herein as being applied to an accessibility time period may beapplied equally to an inaccessibility time period, i.e., a time periodin which people are denied access to resources within an affinity planeand/or sector, even if those people are associated with the affinityplane and/or sector.

The method 400 and system 500 of FIGS. 4 and 5 may use the accessibilitytime periods of affinity planes and sectors to limit the times duringwhich the requestor 402 is granted access to the requested resource. Forexample, the access control module 408 may, as part of the method 500,identify a current time (such as a time specified by a clock or a timespecified by the request 404). The access control module 408 may thentreat the current time as an additional condition which must besatisfied by any accessibility time periods associated with affinityplanes and sectors analyzed in operations 512 and 514 in the method 500of FIG. 5. For example, the access control module 408 may consider thecondition of operation 512 to be satisfied only if: (1) the affinityplanes of the resource owner that are associated with the requestor 402either have no accessibility time period or have an accessibility timeperiod that includes the current time; and (2) the requestor-associatedaffinity planes sufficiently overlap with the resource-associatedaffinity planes. Similarly, the access control module 408 may considerthe condition of operation 514 to be satisfied only if: (1) the sectorsof the resource owner that are associated with the requestor 402 eitherhave no accessibility time period or have an accessibility time periodthat includes the current time; and (2) the request-associated sectorssufficiently overlap with the resource-associated sectors.

The resource access control system 400 and method of FIGS. 4 and 5,which controls access to resources based on affinity planes and sectors,may be supplemented by the use of rules. For example, the owner of aresource may define one or more rules that must be satisfied to grantaccess to the resource. In this case, the access control module 408 may,as part of the method 500, also identify the rule(s), if any, associatedwith the requested resource, apply the identified rule, and deny accessto the requested resource if the identified rule is not satisfied. Theaccess control module 408 may, in other words, treat the identified ruleas an additional condition that must be satisfied to grant access to therequested resource.

Different rules may be associated with different resources. Theconditions of a rule may, for example, apply to data associated with therequester 402, such as the requestor's name, ID (e.g., email address),or category (e.g., friend, family, co-worker). Rules may includetemporal conditions, such as any one or more of the following: a dateand/or time of the request, a duration of the request, and an age of therequestor. Rules may include location-based conditions, such as any oneor more of the following: a geographic region of the region (e.g., asdefined by a range of coordinates), a current proximity of the requestorto the person whose resources are the target of the request, and a typeof location of the request (e.g., park, home, school, stadium).

Relationships among people, resources, affinity planes, and sectors maybe displayed visually in any of a variety of ways. For example,embodiments of the present invention may be used to display a user'saffinity planes in a proximity map, as shown by the example display 1200of FIG. 12. Assume for purposes of example that the display 1200represents the affinity planes of a particular person P₀ as circles 1202a-e. The proximity of (i.e., distance between) any two of the circles1202 a-e to each other may represent the number of people and/orresources shared by the two circles. For example, circle 1202 a iscloser to circle 1202 b than to circle 1202 e, which indicates that thefamily affinity plane 1202 a contains more people and/or resources incommon with the fine art affinity plane 1202 b than with the workaffinity plane 1202 e.

Other visual features of the circles 1202 a-e may be varied to representproperties of the affinity planes 1202 a-e and their relationships witheach other. For example, size and/or color of the circles 1202 a-e maybe used to represent comparative metrics. For example, the size and/orcolor of the circles 1202 a-e may vary based on the number of resourcescontained, the current activity level, or the relative importance (e.g.,weight and/or rank) of the corresponding affinity planes.

Each person within the network of a particular person (e.g., person P₀)may be assigned an “affinity coefficient” in relation to person P₀ basedon factors such as the person's number of occurrences within person P₀'saffinity planes and the relative importance of the topics in which theperson occurs In one particular embodiment, such an affinity coefficientmay be calculated using the following equation:

$c_{p} = \frac{\sum\limits_{\alpha = 1}^{n}{{occurrences}_{p,i}*{weight}_{\alpha}}}{\sum\limits_{p = 1}^{m}{\sum\limits_{i = 1}^{n}{{occurrences}_{p,i}*{weight}_{i}}}}$

Once such an affinity coefficient has been calculated for multiplepeople, e.g., people P₁ and P₂, the affinity coefficients for thosepeople may be used to display the relative strengths of therelationships between person P₀ and each of people P₁ and P₂. Such adisplay may, for example, take the form of a pie chart in which eachperson P₁ and P₂ is represented by a pie slice that is proportional insize to the person's affinity coefficient. As another example, such adisplay may take the form of a bar chart in which each person P₁ and P₂is represented by a bar that is proportional in size to the person'saffinity coefficient.

Embodiments of the present invention may be used to display variousother features of people, resources, affinity planes, and sectors. Forexample, the people and/or resources that are associated with affinityplanes and/or sectors may change over time. Embodiments of the presentinvention may record (i.e., take “snapshots” of) the state of aparticular person's affinity planes and/or sectors at multiple points intime, and then display two or more of those snapshots, such as bydisplaying those snapshots simultaneously side-by-side, simultaneouslyin a three-dimensional cylinder, or sequentially in an animation thatdemonstrates the change in association of people/resources withplanes/sectors over time. For example, referring to FIG. 13, anillustration is shown of a display 1300 of four snapshots 1302 a-d of auser's affinity planes and sectors over time. In the particular exampleof FIG. 13, the display 1300 shows the snapshots 1302 a-d as planesdrawn in perspective, in chronological order with the oldest snapshot1302 a at the bottom and the most recent snapshot 1302 d at the top.

In the particular example of FIG. 13, the snapshots 1302 a-d aresnapshots of the affinity planes and sectors of person P₀, with theoldest snapshot 1302 a being a snapshot of person P₀'s affinity planesand sectors at the time shown in FIG. 1B. The snapshot 1302 a,therefore, is identical to the affinity planes and sectors shown in FIG.1B, except that the snapshot 1302 a in FIG. 13 is shown in perspective.

The next snapshot 1302 b is identical to the snapshot 1302 a, exceptthat the sector 112 c has been removed and the sector 112 b extends intothe center of affinity plane 112 a (as indicated by the labeling of themodified sector as 112 b′). These changes represent changes that weremade (e.g., manually by person P₀) after the time at which snapshot 1302a was taken and before snapshot 1302 b was taken.

The next snapshot 1302 b is identical to the snapshot 1302 c, exceptthat a box 1304, extending across parts of affinity planes 102 b and 102c, has been added. The box 1304, which may be associated with one ormore people other than person P₀, indicates that the people associatedwith the box 1304 have the right to access some, but not all, of theresources within affinity planes 102 b and 102 c. The differencesbetween snapshot 1302 b and 1302 c represent changes that were made(e.g., manually by person P₀) after the time at which snapshot 1302 bwas taken and before snapshot 1302 c was taken.

The next snapshot 1302 b is identical to the snapshot 1302 c, exceptthat an additional affinity plane 102 d has been added. The new affinityplane 102 d may be of any of the types described herein, and may be usedto control access to person P₀'s resources in any of the ways disclosedherein. The differences between snapshot 1302 c and 1302 d representchanges that were made (e.g., manually by person P₀) after the time atwhich snapshot 1302 c was taken and before snapshot 1302 d was taken.

Although in FIG. 13 only the affinity planes change over time (i.e.,from snapshot to snapshot), this is merely an example and does notconstitute a limitation of the present invention. More generally,graphical user interfaces such as the one shown in FIG. 13 may showchanges in any one or more of the following, without limitation:affinity planes, sectors, boxes, and assignment of people and/orresources to affinity planes, sectors, and boxes.

The particular number, content, and graphical representation of thesnapshots 1302 a-d shown in FIG. 13 are merely examples and do notconstitute limitations of the present invention. Those having ordinaryskill in the art will appreciate that changes to affinity planes andsectors over time may be recorded and displayed in any manner.

Among the advantages of the invention are one or more of the following.For example, in general, embodiments of the present invention enableusers to exercise flexible, fine-grained control over access to theirresources, in a way that is at least partially automated. Existingsystems tend to provide users either with no control over access totheir resources, or only simple access to their resources on auser-by-user or role-by-role basis. Often, such control is merely binaryin nature, in which other users who are “friends” are granted unlimitedaccess and in which non-“friends” are granted no access. In contrast,embodiments of the present invention provide users with a high degree offlexibility in defining and implementing resource access control, basedon a combination of the user's relationship to the requestor and thesector (e.g., domain) of the requested resource. As a result,embodiments of the present invention enable users to overcome thelimitations of simple role-based resource access control.

Another advantage of embodiments of the present invention is that theyenable people and resources to be assigned to affinity planes andsectors automatically or semi-automatically. For example, documents maybe assigned automatically to sectors based on the degree of similaritybetween the contents of the documents and the keywords that define thesectors. Such a feature may be used to relieve users of the burden ofmanually assigning each resource to an affinity plane and/or sector, andto reduce the likelihood of false positives (i.e., assigning a resourceto an affinity plane or sector to which it should not have beenassigned) and false negatives (i.e., failing to assign a resource to anaffinity plane or sector to which it should have been assigned).

A related benefit of embodiments of the present invention is that theyenable users to manually assign people and resources to affinity planesand sectors, thereby providing users with whatever degree of controlthey desire over such assignment. For example, in some cases users maydesire to assign resources to affinity planes and sectors manually on aresource-by-resource basis (as in the case of particularly sensitiveresources). As another example, users may prefer for the system toautomatically assign resources to affinity planes and sectors as a firstpass, and then to review the system's automatic assignments and manuallycorrect any incorrect assignments. Embodiments of the present inventionenable users to combine automatic and manual assignment in anycombination they please, thereby providing users with maximum controlover access to their resources without imposing an undue burden on themto perform assignments manually in all cases.

It is to be understood that although the invention has been describedabove in terms of particular embodiments, the foregoing embodiments areprovided as illustrative only, and do not limit or define the scope ofthe invention. Various other embodiments, including but not limited tothe following, are also within the scope of the claims. For example,elements and components described herein may be further divided intoadditional components or joined together to form fewer components forperforming the same functions.

Any of the functions disclosed herein may be implemented using means forperforming those functions. Such means include, but are not limited to,any of the components disclosed herein, such as the computer-relatedcomponents described below.

Various references are made herein to “resources,” such as resourcesowned, created, or otherwise associated with a particular person.Examples of such resources include, but are not limited to, documents(such as word processing documents, spreadsheet documents, presentationdocuments, and multimedia documents), music and other audio files,videos, databases, messages (such as email messages, text messages,voicemail messages, and social networking messages), web sites and webpages, blogs and blog postings, user credentials (such as usernames andpasswords for web sites and applications), user profiles (such as userprofiles on social networking systems), demographic data (such as age,sex, religion, race, nationality, and income), medical records,behavioral data (such as records of inputs provided to applications andweb sites), and tags that act as links to or proxies for otherdescriptors (such as XML tags, URLs, and VRML tags). Although certainexamples of resources provided herein are static resources, such asstatic images, this is not a limitation of the present invention.Resources may be dynamic, such as documents that change over time andresources (such as calendar appointments) that occur during certaintimes and not during other times. The term “resource” includes anyportion(s) of a resource (such as the contents of a single page on a website or a single record in a database) and any combination of resources(such as a combination of the content of a web page and its URL).

Various elements of embodiments of the present invention may bepredefined (e.g., by a system administrator) and then applied to theresources, affinity planes, and sectors of one or more users.Additionally or alternatively, such elements may be defined byindividual users and then applied to the resources, affinity planes, andsectors of those users.

For example, one or more affinity planes may be predefined and then madeavailable for use by one or more users of the system. Similarly, one ormore sectors may be predefined and then made available for use by one ormore users of the system. As another example, a particular user P₀ maydefine one or more affinity planes, which may then be made available foruse solely by user P₀, or be made available for use by both user P₀ andother users. Similarly, a particular user P₀ may define one or moresectors, which may then be made available for use solely by user P₀, orbe made available for use by both user P₀ and other users.

As yet another example, one or more assignment rules for automaticallyassigning people and/or resources to affinity planes and/or sectors maybe predefined and then made available for use by one or more users ofthe system. As yet another example, a particular user P₀ may define oneor more assignment rules, which may then be made available for usesolely by user P₀, or be made available for use by both user P₀ andother users.

Although entities such as P₀, P₁, and P₂ are referred to herein as“people,” this is merely an example and does not constitute a limitationof the present invention. More generally, an entity such as P₀ may, forexample, be an organization (such as a for-profit or non-profitcorporation), product, or brand. Therefore, any reference herein to a“person” should be understood to refer more generally to any entity,such as an entity of any of the kinds just listed.

The techniques described above may be implemented, for example, inhardware, one or more computer programs tangibly stored on one or morecomputer-readable media, firmware, or any combination thereof. Thetechniques described above may be implemented in one or more computerprograms executing on (or executable by) a programmable computerincluding any combination of any number of the following: a processor, astorage medium readable and/or writable by the processor (including, forexample, volatile and non-volatile memory and/or storage elements), aninput device, and an output device. Program code may be applied to inputentered using the input device to perform the functions described and togenerate output using the output device.

Each computer program within the scope of the claims below may beimplemented in any programming language, such as assembly language,machine language, a high-level procedural programming language, or anobject-oriented programming language. The programming language may, forexample, be a compiled or interpreted programming language.

Each such computer program may be implemented in a computer programproduct tangibly embodied in a machine-readable storage device forexecution by a computer processor. Method steps of the invention may beperformed by one or more computer processors executing a programtangibly embodied on a computer-readable medium to perform functions ofthe invention by operating on input and generating output. Suitableprocessors include, by way of example, both general and special purposemicroprocessors. Generally, the processor receives (reads) instructionsand data from a memory (such as a read-only memory and/or a randomaccess memory) and writes (stores) instructions and data to the memory.Storage devices suitable for tangibly embodying computer programinstructions and data include, for example, all forms of non-volatilememory, such as semiconductor memory devices, including EPROM, EEPROM,and flash memory devices; magnetic disks such as internal hard disks andremovable disks; magneto-optical disks; and CD-ROMs. Any of theforegoing may be supplemented by, or incorporated in, specially-designedASICs (application-specific integrated circuits) or FPGAs(Field-Programmable Gate Arrays). A computer can generally also receive(read) programs and data from, and write (store) programs and data to, anon-transitory computer-readable storage medium such as an internal disk(not shown) or a removable disk. These elements will also be found in aconventional desktop or workstation computer as well as other computerssuitable for executing computer programs implementing the methodsdescribed herein, which may be used in conjunction with any digitalprint engine or marking engine, display monitor, or other raster outputdevice capable of producing color or gray scale pixels on paper, film,display screen, or other output medium.

Any data disclosed herein may be implemented, for example, in one ormore data structures tangibly stored on a non-transitorycomputer-readable medium. Embodiments of the invention may store suchdata in such data structure(s) and read such data from such datastructure(s).

What is claimed is:
 1. A method for use with a system, wherein themethod is performed by at least one computer processor executingcomputer program instructions stored on at least one non-transitorycomputer-readable medium, the system comprising: a plurality of affinityplanes associated with a first person P₀; a plurality of sectorsassociated with first person P₀; data representing an associationAffinity_P₀ (A₀, P₁) between an affinity plane A₀ and second person P₁,wherein the affinity plane A₀ is within the plurality of affinity planesassociated with first person P₀; data representing an associationSector_P₀(S₀, P₁) between a sector S₀ and second person P₁, wherein thesector S₀ is within the plurality of sectors associated with firstperson P₀; data representing an association Affinity_P₀ (A₁, R₀) betweenan affinity plane A₁ and a first resource R₀, wherein the affinity planeA₁ is within the plurality of affinity planes associated with firstperson P₀; data representing an association Sector_P₀ (S₁, R₀) between asector S₁ and first resource R₀, wherein the sector S₁ is within theplurality of sectors associated with first person P₀; wherein the methodcomprises: (1) determining whether affinity plane A₀ includes affinityplane A₁; (2) determining whether sector S₀ includes sector S₁; and (3)granting person P₁ with access to resource R₀ if: (a) affinity plane A₀is determined to include affinity plane A₁; and (b) sector S₀ isdetermined to include sector S₁.
 2. The method of claim 1, furthercomprising: (4) before (3), receiving a request to grant person P₁ withaccess to resource R₀; and wherein (3) comprises: (3) (a) granting therequest if affinity plane A₀ is determined to include affinity plane A₁and sector S₀ is determined to include sector S₁; and (3) (b) denyingthe request if affinity plane A₀ is not determined to include affinityplane A₁ or sector S₀ is not determined to include sector S₁.
 3. Themethod of claim 2, wherein the request comprises a request specifyingresource R₀.
 4. The method of claim 2, wherein the request comprises arequest to access a plurality of resources including resource R₀.
 5. Themethod of claim 4, wherein the request comprises a request to access anaffinity plane containing resource R₀.
 6. The method of claim 4, whereinthe request comprises a request to access a sector containing resourceR₀.
 7. The method of claim 1: wherein the plurality of affinity planesincludes: a first affinity plane representing a first closeness ofrelationship to person P₀; and a second affinity plane representing asecond closeness of relationship to person P₀, wherein the firstcloseness of relationship differs from the second closeness ofrelationship.
 8. The method of claim 7, wherein the first affinity planecontains the second affinity plane.
 9. The method of claim 7, whereinthe first affinity plane contains some but not all of the secondaffinity plane.
 10. The method of claim 7, wherein the first affinityplane and the second affinity plane are disjoint.
 11. The method ofclaim 1: wherein the plurality of sectors includes: a first sectorrepresenting a first topic of interest to the first person P₀; and asecond sector representing a second topic of interest to the firstperson P₀, wherein the first topic differs from the second topic. 12.The method of claim 11, wherein the first sector contains the secondsector.
 13. The method of claim 11, wherein the first sector containssome but not all of the second sector.
 14. The method of claim 11,wherein the first sector and the second sector are disjoint.
 15. Themethod of claim 1: wherein the data representing the association betweenthe second person P₁ and the affinity plane A₀ comprises datarepresenting an association between the second person P₁ and affinityplanes A₀ and A₂, wherein affinity plane A₂ is within the plurality ofaffinity planes associated with first person P₀; wherein (1) comprisesdetermining whether affinity planes A₀ and/or A₂ include affinity planeA₁; and wherein (3) comprises granting person P₁ with access to resourceR₀ if: (a) affinity plane A₀ and/or A₂ is determined to include affinityplane A₁; and (b) sector S₀ is determined to include sector S₁.
 16. Themethod of claim 1: wherein the data representing the association betweenthe second person P₁ and the sector S₀ comprises data representing anassociation between the second person P₁ and sectors S₀ and S₂, whereinsector S₂ is within the plurality of sectors associated with firstperson P₀; wherein (2) comprises determining whether sectors S₀ and/orS₂ include sector S₁; and wherein (3) comprises granting person P₁ withaccess to resource R₀ if: (a) affinity plane A₀ is determined to includeaffinity plane A₁; and (b) sector S₀ and/or S₂ is determined to includesector S₁.
 17. The method of claim 1: wherein the data representing theassociation between the first resource R₀ and the affinity plane A₁comprises data representing an association between first resource R₀ andaffinity planes A₁ and A₂, wherein affinity plane A₂ is within theplurality of affinity planes associated with first person P₀; wherein(1) comprises determining whether affinity plane A₀ includes affinityplanes A₁ and/or A₂; and wherein (3) comprises granting person P₁ withaccess to resource R₀ if: (a) affinity plane A₀ is determined to includeaffinity planes A₁ and/or A₂; and (b) sector S₀ is determined to includesector S₁.
 18. The method of claim 1: wherein the data representing theassociation between the first resource R₀ and the sector S₁ comprisesdata representing an association between first resource R₀ associatedwith sectors S₁ and S₂, wherein sector S₂ is within the plurality ofsectors associated with first person P₀; wherein (2) comprisesdetermining whether sector S₀ includes sectors S₁ and/or S₂; and wherein(3) comprises granting person B with access to resource R₀ if: (a)affinity plane A₀ is determined to include affinity plane A₁; and (b)sector S₀ is determined to include sectors S₁ and/or S₂.
 19. The methodof claim 1, wherein the system further comprises: data representing anassociation Affinity_P₀(A₃, P₂) between an affinity plane A₂ and a thirdperson P₃, wherein affinity plane A₂ is identical to affinity plane A₀.20. The method of claim 1, wherein the system further comprises: datarepresenting an association Affinity_P₀(A₂, R₁) between an affinityplane A₂ and a second resource R₁, wherein affinity plane A₂ isidentical to affinity plane A₁.
 21. The method of claim 1, wherein thesystem further comprising: data representing an associationSector_P₀(S₂, P₂) between a sector S₂ and a third person P₂, whereinsector S₂ is identical to sector S₀.
 22. The method of claim 1, whereinthe system further comprises: data representing an associationSector_P₀(S₂, R₁) between a sector S₂ and a second resource R₁, whereinsector S₂ is identical to sector S₁.
 23. The method of claim 1, whereinthe system further comprises: a plurality of affinity planes associatedwith the second person P₁; a plurality of sectors associated with thesecond person P₁; data representing an association Affinity_P₁(A₂, P₀)between the first person P₀ and an affinity plane A₂, wherein theaffinity plane A₂ is within the plurality of affinity planes associatedwith second person P₁; data representing an association Affinity_P₁(S₂,P₀) between the first person P₀ and a sector S₂, wherein the sector S₂is within the plurality of sectors associated with second person P₁;data representing an association Affinity_P₁(A₃, R₁) between a secondresource R₁ and an affinity plane A₃, wherein the affinity plane A₃ iswithin the plurality of affinity planes associated with second personP₁; and data representing an association Affinity_P₁(S₃, R₁) between thesecond resource R₁ and a sector S₃, wherein the sector S₃ is within theplurality of affinity planes associated with second person P₁; whereinthe method further comprises (4) determining whether affinity plane A₂includes affinity plane A₃; (5) determining whether sector S₂ includessector S₃; and (6) granting person P₀ with access to resource R₁ if: (a)affinity plane A₂ is determined to include affinity plane A₃; and (b)sector S₂ is determined to include sector S₃.
 24. The method of claim 1:wherein affinity plane A₀ is associated with an accessibility timeperiod; and wherein the method further comprises: (4) before (3),determining whether a current time is within the accessibility timeperiod associated with affinity plane A₀; and wherein (3) comprisesgranting person P₁ with access to resource R₀ if: (a) affinity plane A₀is determined to include affinity plane A₁; (b) sector S₀ is determinedto include sector S₁; and (c) the current time is determined to bewithin the accessibility time period associated with affinity plane A₀.25. The method of claim 1: wherein affinity plane A₀ is associated withan accessibility time period; and wherein the method further comprises:(4) before (3), determining whether a current time is within theaccessibility time period associated with affinity plane A₀; and wherein(3) comprises granting person P₁ with access to resource R₀ if: (a)affinity plane A₀ is determined to include affinity plane A₁; (b) sectorS₀ is determined to include sector S₁; and (c) the current time isdetermined to be within the accessibility time period associated withaffinity plane A₀.
 26. The method of claim 1: wherein sector S₀ isassociated with an accessibility time period; and wherein the methodfurther comprises: (4) before (3), determining whether a current time iswithin the accessibility time period associated with sector S₀; andwherein (3) comprises granting person P₁ with access to resource R₀ if:(a) affinity plane A₀ is determined to include affinity plane A₁; (b)sector S₀ is determined to include sector S₁; and (c) the current timeis determined to be within the accessibility time period associated withsector S₀.
 27. The method of claim 1: wherein sector S₁ is associatedwith an accessibility time period; and wherein the method furthercomprises: (4) before (3), determining whether a current time is withinthe accessibility time period associated with sector S₁; and wherein (3)comprises granting person P₁ with access to resource R₀ if: (a) affinityplane A₀ is determined to include affinity plane A•; (b) sector S₀ isdetermined to include sector S₁; and (c) the current time is determinedto be within the accessibility time period associated with sector S₁.28. The method of claim 1, further comprising: (4) identifying dataassociated with person P₁; (5) determining whether the data associatedwith person P₁ satisfies a predetermined rule; and (6) denying person P₁access to resource R₀ if the data associated with person P₁ does notsatisfy the predetermined rule.
 29. The method of claim 28, wherein thedata associated with person P₁ comprises a name of person P.
 30. Themethod of claim 1: wherein affinity plane A₀ is associated with a firstweight; wherein the system further comprises data representing anassociation between a third person P₂ and an affinity plane A₂, whereinthe affinity plane A₂ is within the plurality of affinity planesassociated with first person P₀; wherein affinity plane A₂ is associatedwith a first weight; and wherein the method further comprises: (4)identifying a first distance between person P₀ and person P₁ based onthe first weight; and (5) identifying a second distance between personP₀ and person P₂ based on the second weight.
 31. The method of claim 30,further comprising: (6) rendering first graphical output representingthe first distance; and (7) rendering second graphical outputrepresenting the second distance.
 32. A system comprising: at least onecomputer processor; at least one non-transitory computer-readable mediumcomprising computer-program instructions executable by the at least onecomputer processor to perform a method; a plurality of affinity planesassociated with a first person P₀; a plurality of sectors associatedwith first person P₀; data representing an association Affinity_P₀ (A₀,P₁) between an affinity plane A₀ and second person P₁, wherein theaffinity plane A₀ is within the plurality of affinity planes associatedwith first person P₀; data representing an association Sector_P₀(S₀, P₁)between a sector S₀ and second person P₁, wherein the sector S₀ iswithin the plurality of sectors associated with first person P₀; datarepresenting an association Affinity_P₀ (A₁, R₀) between an affinityplane A₁ and a first resource R₀, wherein the affinity plane A₁ iswithin the plurality of affinity planes associated with first person P₀;data representing an association Sector_P₀ (S₁, R₀) between a sector S₁and first resource R₀, wherein the sector S₁ is within the plurality ofsectors associated with first person P₀; wherein the method comprises:(1) determining whether affinity plane A₀ includes affinity plane A₁;(2) determining whether sector S₀ includes sector S₁; and (3) grantingperson P₁ with access to resource R₀ if: (a) affinity plane A₀ isdetermined to include affinity plane A₁; and (b) sector S₀ is determinedto include sector S₁.
 33. The system of claim 32, wherein the methodfurther comprises: (4) before (3), receiving a request to grant personP₁ with access to resource R₀; and wherein (3) comprises: (3) (a)granting the request if affinity plane A₀ is determined to includeaffinity plane A₁ and sector S₀ is determined to include sector S₁; and(3) (b) denying the request if affinity plane A₀ is not determined toinclude affinity plane A₁ or sector S₀ is not determined to includesector S₁.
 34. The system of claim 33, wherein the request comprises arequest specifying resource R₀.
 35. The system of claim 33, wherein therequest comprises a request to access a plurality of resources includingresource R₀.
 36. The system of claim 35, wherein the request comprises arequest to access an affinity plane containing resource R₀.
 37. Thesystem of claim 35, wherein the request comprises a request to access asector containing resource R₀.
 38. The system of claim 32: wherein theplurality of affinity planes includes: a first affinity planerepresenting a first closeness of relationship to person P₀; and asecond affinity plane representing a second closeness of relationship toperson P₀, wherein the first closeness of relationship differs from thesecond closeness of relationship.
 39. The system of claim 38, whereinthe first affinity plane contains the second affinity plane.
 40. Thesystem of claim 38, wherein the first affinity plane contains some butnot all of the second affinity plane.
 41. The system of claim 38,wherein the first affinity plane and the second affinity plane aredisjoint.
 42. The system of claim 42: wherein the plurality of sectorsincludes: a first sector representing a first topic of interest to thefirst person P₀; and a second sector representing a second topic ofinterest to the first person P₀, wherein the first topic differs fromthe second topic.
 43. The system of claim 42, wherein the first sectorcontains the second sector.
 44. The system of claim 42, wherein thefirst sector contains some but not all of the second sector.
 45. Thesystem of claim 42, wherein the first sector and the second sector aredisjoint.
 46. The system of claim 32: wherein the data representing theassociation between the second person P₁ and the affinity plane A₀comprises data representing an association between the second person P₁and affinity planes A₀ and A₂, wherein affinity plane A₂ is within theplurality of affinity planes associated with first person P₀; wherein(1) comprises determining whether affinity planes A₀ and/or A₂ includeaffinity plane A₁; and wherein (3) comprises granting person P₁ withaccess to resource R₀ if: (a) affinity plane A₀ and/or A₂ is determinedto include affinity plane A₁; and (b) sector S₀ is determined to includesector S₁.
 47. The system of claim 32: wherein the data representing theassociation between the second person P₁ and the sector S₀ comprisesdata representing an association between the second person P₁ andsectors S₀ and S₂, wherein sector S₂ is within the plurality of sectorsassociated with first person P₀; wherein (2) comprises determiningwhether sectors S₀ and/or S₂ include sector S₁; and wherein (3)comprises granting person P₁ with access to resource R₀ if: (a) affinityplane A₀ is determined to include affinity plane A₁; and (b) sector S₀and/or S₂ is determined to include sector S₁.
 48. The system of claim32: wherein the data representing the association between the firstresource R₀ and the affinity plane A₁ comprises data representing anassociation between first resource R₀ and affinity planes A₁ and A₂,wherein affinity plane A₂ is within the plurality of affinity planesassociated with first person P₀; wherein (1) comprises determiningwhether affinity plane A₀ includes affinity planes A₁ and/or A₂; andwherein (3) comprises granting person P₁ with access to resource R₀ if:(a) affinity plane A₀ is determined to include affinity planes A₁ and/orA₂; and (b) sector S₀ is determined to include sector S₁.
 49. The systemof claim 32: wherein the data representing the association between thefirst resource R₀ and the sector S₁ comprises data representing anassociation between first resource R₀ associated with sectors S₁ and S₂,wherein sector S₂ is within the plurality of sectors associated withfirst person P₀; wherein (2) comprises determining whether sector S₀includes sectors S₁ and/or S₂; and wherein (3) comprises granting personB with access to resource R₀ if: (a) affinity plane A₀ is determined toinclude affinity plane A₁; and (b) sector S₀ is determined to includesectors S₁ and/or S₂.
 50. The system of claim 32, wherein the systemfurther comprises: data representing an association Affinity_P₀(A₃, P₂)between an affinity plane A₂ and a third person P₃, wherein affinityplane A₂ is identical to affinity plane A₀.
 51. The system of claim 32,wherein the system further comprises: data representing an associationAffinity_P₀(A₂, R₁) between an affinity plane A₂ and a second resourceR₁, wherein affinity plane A₂ is identical to affinity plane A₁.
 52. Thesystem of claim 32, wherein the system further comprising: datarepresenting an association Sector_P₀(S₂, R₂) between a sector S₂ and athird person P₂, wherein sector S₂ is identical to sector S₀.
 53. Thesystem of claim 32, wherein the system further comprises: datarepresenting an association Sector_P₀(S₂, R₁) between a sector S₂ and asecond resource R₁, wherein sector S₂ is identical to sector S₁.
 54. Thesystem of claim 32, wherein the system further comprises: a plurality ofaffinity planes associated with the second person P₁; a plurality ofsectors associated with the second person P₁; data representing anassociation Affinity_P₁(A₂, P₀) between the first person P₀ and anaffinity plane A₂, wherein the affinity plane A₂ is within the pluralityof affinity planes associated with second person P₁; data representingan association Affinity_P₁(S₂, P₀) between the first person P₀ and asector S₂, wherein the sector S₂ is within the plurality of sectorsassociated with second person P₁; data representing an associationAffinity_P₁(A₃, R₁) between a second resource R₁ and an affinity planeA₃, wherein the affinity plane A₃ is within the plurality of affinityplanes associated with second person P₁; and data representing anassociation Affinity_P₁(S₃, R₁) between the second resource R₁ and asector S₃, wherein the sector S₃ is within the plurality of affinityplanes associated with second person P₁; wherein the method furthercomprises (4) determining whether affinity plane A₂ includes affinityplane A₃; (5) determining whether sector S₂ includes sector S₃; and (6)granting person P₀ with access to resource R₁ if: (a) affinity plane A₂is determined to include affinity plane A₃; and (b) sector S₂ isdetermined to include sector S₃.
 55. The system of claim 32: whereinaffinity plane A₀ is associated with an accessibility time period; andwherein the method further comprises: (4) before (3), determiningwhether a current time is within the accessibility time periodassociated with affinity plane A₀; and wherein (3) comprises grantingperson P₁ with access to resource R₀ if: (a) affinity plane A₀ isdetermined to include affinity plane A₁; (b) sector S₀ is determined toinclude sector S₁; and (c) the current time is determined to be withinthe accessibility time period associated with affinity plane A₀.
 56. Thesystem of claim 32: wherein affinity plane A₀ is associated with anaccessibility time period; and wherein the method further comprises: (4)before (3), determining whether a current time is within theaccessibility time period associated with affinity plane A₀; and wherein(3) comprises granting person P₁ with access to resource R₀ if: (a)affinity plane A₀ is determined to include affinity plane A₁; (b) sectorS₀ is determined to include sector S₁; and (c) the current time isdetermined to be within the accessibility time period associated withaffinity plane A₀.
 57. The system of claim 32: wherein sector S₀ isassociated with an accessibility time period; and wherein the methodfurther comprises: (4) before (3), determining whether a current time iswithin the accessibility time period associated with sector S₀; andwherein (3) comprises granting person P₁ with access to resource R₀ if:(a) affinity plane A₀ is determined to include affinity plane A₁; (b)sector S₀ is determined to include sector S₁; and (c) the current timeis determined to be within the accessibility time period associated withsector S₁.
 58. The system of claim 32: wherein sector S₁ is associatedwith an accessibility time period; and wherein the method furthercomprises: (4) before (3), determining whether a current time is withinthe accessibility time period associated with sector S₁; and wherein (3)comprises granting person P₁ with access to resource R₀ if: (a) affinityplane A₀ is determined to include affinity plane A•; (b) sector S₀ isdetermined to include sector S₁; and (c) the current time is determinedto be within the accessibility time period associated with sector S₁.59. The system of claim 32, wherein the method further comprises: (4)identifying data associated with person P₁; (5) determining whether thedata associated with person P₁ satisfies a predetermined rule; and (6)denying person P₁ access to resource R₀ if the data associated withperson P₁ does not satisfy the predetermined rule.
 60. The system ofclaim 59, wherein the data associated with person P₁ comprises a name ofperson P.
 61. The system of claim 32: wherein affinity plane A₀ isassociated with a first weight; wherein the system further comprisesdata representing an association between a third person P₂ and anaffinity plane A₂, wherein the affinity plane A₂ is within the pluralityof affinity planes associated with first person P₀; wherein affinityplane A₂ is associated with a first weight; and wherein the methodfurther comprises: (4) identifying a first distance between person P₀and person P₁ based on the first weight; and (5) identifying a seconddistance between person P₀ and person P₂ based on the second weight. 62.The system of claim 61, wherein the method further comprises: (6)rendering first graphical output representing the first distance; and(7) rendering second graphical output representing the second distance.63. A method performed by at least one computer processor executingcomputer program instructions stored on at least one non-transitorycomputer-readable medium, the method comprising: (1) receiving firstdata related to a first person P₀; (2) analyzing the first data toidentify a first closeness of relationship between the first person P₀and a second person P₁; (3) selecting, based on the first closeness ofrelationship, a first affinity plane selected from a plurality ofaffinity planes associated with the first person P₀, wherein theplurality of affinity planes includes: the first affinity plane, whereinthe first affinity plane represents the first closeness of relationship;and a second affinity plane representing a second closeness ofrelationship, wherein the first closeness of relationship differs fromthe second closeness of relationship; and (4) associating the firstaffinity plane with the second person P.
 64. The method of claim 63:wherein (2) further comprises analyzing the data to identify a secondcloseness of relationship between the first person P₀ and a third personP₁; and wherein the method further comprises: (5) selecting, based onthe second closeness of relationship, a second affinity plane selectedfrom the plurality of affinity planes associated with the first personP₀, wherein the at least one first affinity plane differs from the atleast one second affinity plane; and (6) associating the second affinityplane with the third person P.
 65. The method of claim 63, wherein thedata analyzed in (2) comprises contact data in an electronic addressbook of person P₀.
 66. The method of claim 63, wherein the data analyzedin (2) comprises contact data in a plurality of electronic address booksof person P₀.
 67. The method of claim 63, wherein the data analyzed in(2) comprises contact electronic communications between the first personP₀ and the second person P.
 68. The method of claim 63, wherein (2)comprises identifying the first closeness of relationship based on afrequency of communication between the first person P₀ and the secondperson P.
 69. The method of claim 63, wherein (2) comprises identifyingthe first closeness of relationship based on a type of communicationbetween the first person P₀ and the second person P.
 70. The method ofclaim 63, further comprising: (5) before (2), receiving first affinityplane definition data defining the first affinity plane; and wherein (3)comprises selecting the first affinity plane based on the affinity planedefinition data.
 71. The method of claim 70, wherein (5) comprisesreceiving the first affinity plane definition data from the first personP₀.
 72. The method of claim 70, wherein (5) comprises receiving thefirst affinity plane definition data from a person other than the firstperson P₀.
 73. The method of claim 63, further comprising: (5)receiving, from a user, input specifying a second affinity plane withinthe plurality of affinity planes associated with the first person P₀;and (6) in response to the input received in (5): (6)(a) disassociatingthe first affinity plane from the second person; and (6)(b) associatingthe second affinity plane with the second person.
 74. The method ofclaim 73, further comprising: (5) receiving second data related to thefirst person P₀; (6) selecting the second affinity plane; and (7)associating the second affinity plane with the second person P.
 75. Asystem comprising: at least one computer processor; at least onenon-transitory computer-readable medium comprising computer-programinstructions executable by the at least one computer processor toperform a method; the method comprising: (1) receiving first datarelated to a first person P₀; (2) analyzing the first data to identify afirst closeness of relationship between the first person P₀ and a secondperson P₁; (3) selecting, based on the first closeness of relationship,a first affinity plane selected from a plurality of affinity planesassociated with the first person P₀, wherein the plurality of affinityplanes includes: the first affinity plane, wherein the first affinityplane represents the first closeness of relationship; and a secondaffinity plane representing a second closeness of relationship, whereinthe first closeness of relationship differs from the second closeness ofrelationship; and (4) associating the first affinity plane with thesecond person P.
 76. The system of claim 75: wherein (2) furthercomprises analyzing the data to identify a second closeness ofrelationship between the first person P₀ and a third person P₁; andwherein the method further comprises: (5) selecting, based on the secondcloseness of relationship, a second affinity plane selected from theplurality of affinity planes associated with the first person P₀,wherein the at least one first affinity plane differs from the at leastone second affinity plane; and (6) associating the second affinity planewith the third person P.
 77. The system of claim 75, wherein the dataanalyzed in (2) comprises contact data in an electronic address book ofperson P₀.
 78. The system of claim 75, wherein the data analyzed in (2)comprises contact data in a plurality of electronic address books ofperson P₀.
 79. The system of claim 75, wherein the data analyzed in (2)comprises contact electronic communications between the first person P₀and the second person P.
 80. The system of claim 75, wherein (2)comprises identifying the first closeness of relationship based on afrequency of communication between the first person P₀ and the secondperson P.
 81. The system of claim 75, wherein (2) comprises identifyingthe first closeness of relationship based on a type of communicationbetween the first person P₀ and the second person P.
 82. The system ofclaim 75, further comprising: (5) before (2), receiving first affinityplane definition data defining the first affinity plane; and wherein (3)comprises selecting the first affinity plane based on the affinity planedefinition data.
 83. The method of claim 82, wherein (5) comprisesreceiving the first affinity plane definition data from the first personP₀.
 84. The method of claim 82, wherein (5) comprises receiving thefirst affinity plane definition data from a person other than the firstperson P₀.
 85. The method of claim 75, further comprising: (5)receiving, from a user, input specifying a second affinity plane withinthe plurality of affinity planes associated with the first person P₀;and (6) in response to the input received in (5): (6)(a) disassociatingthe first affinity plane from the second person; and (6)(b) associatingthe second affinity plane with the second person.
 86. The method ofclaim 85, further comprising: (5) receiving second data related to thefirst person P₀; (6) selecting the second affinity plane; and (7)associating the second affinity plane with the second person P.
 87. Amethod for use with a system, wherein the method is performed by atleast one computer processor executing computer program instructionsstored on at least one non-transitory computer-readable medium, thesystem comprising: a plurality of affinity planes associated with afirst person P₀; a plurality of sectors associated with first person P₀;and data representing an association Sector_P₀(S₀, P₁) between a sectorS₀ and second person P₁, wherein the sector S₀ is within the pluralityof sectors associated with first person P₀; data representing anassociation Affinity_P₀ (A₁, R₀) between an affinity plane A₁ and afirst resource R₀, wherein the affinity plane A₁ is within the pluralityof affinity planes associated with first person P₀, data representing anassociation Sector_P₀ (S₁, R₀) between a sector S₁ and first resourceR₀, wherein the sector S₁ is within the plurality of sectors associatedwith first person P₀, wherein the method comprises: (1) determiningwhether sector S₀ includes sector S₁; and (2) granting person P₁ withaccess to resource R₀ if: sector S₀ is determined to include sector S₁.88. A system comprising: at least one computer processor; at least onenon-transitory computer-readable medium comprising computer-programinstructions executable by the at least one computer processor toperform a method; a plurality of affinity planes associated with a firstperson P₀; a plurality of sectors associated with first person P₀; anddata representing an association Sector_P₀(S₀, P₁) between a sector S₀and second person P₁, wherein the sector S₀ is within the plurality ofsectors associated with first person P₀; data representing anassociation Affinity_P₀ (A₁, R₀) between an affinity plane A₁ and afirst resource R₀, wherein the affinity plane A₁ is within the pluralityof affinity planes associated with first person P₀, data representing anassociation Sector_P₀ (S₁, R₀) between a sector S₁ and first resourceR₀, wherein the sector S₁ is within the plurality of sectors associatedwith first person P₀; wherein the method comprises: (1) determiningwhether sector S₀ includes sector S₁; and (2) granting person P₁ withaccess to resource R₀ if: sector S₀ is determined to include sector S₁.89. A method for use with a system, wherein the method is performed byat least one computer processor executing computer program instructionsstored on at least one non-transitory computer-readable medium, thesystem comprising: a plurality of affinity planes associated with afirst person P₀; a plurality of sectors associated with first person P₀;data representing an association Affinity_P₀ (A₀, P₁) between anaffinity plane A₀ and second person P₁, wherein the affinity plane A₀ iswithin the plurality of affinity planes associated with first person P₀;data representing an association Affinity_P₀ (A₁, R₀) between anaffinity plane A₁ and a first resource R₀, wherein the affinity plane A₁is within the plurality of affinity planes associated with first personP₀; and data representing an association Sector_P₀ (S₁, R₀) between asector S₁ and first resource R₀, wherein the sector S₁ is within theplurality of sectors associated with first person P₀; wherein the methodcomprises: (1) determining whether affinity plane A₀ includes affinityplane A₁; and (2) granting person P₁ with access to resource R₀ ifaffinity plane A₀ is determined to include affinity plane A₁.
 90. Asystem comprising: at least one computer processor; at least onenon-transitory computer-readable medium comprising computer-programinstructions executable by the at least one computer processor toperform a method; a plurality of affinity planes associated with a firstperson P₀; a plurality of sectors associated with first person P₀; datarepresenting an association Affinity_P₀ (A₀, P₁) between an affinityplane A₀ and second person P₁, wherein the affinity plane A₀ is withinthe plurality of affinity planes associated with first person P₀; datarepresenting an association Affinity_P₀ (A₁, R₀) between an affinityplane A₁ and a first resource R₀, wherein the affinity plane A₁ iswithin the plurality of affinity planes associated with first person P₀;and data representing an association Sector_P₀ (S₁, R₀) between a sectorS₁ and first resource R₀, wherein the sector S₁ is within the pluralityof sectors associated with first person P₀; wherein the methodcomprises: (1) determining whether affinity plane A₀ includes affinityplane A₁; and (2) granting person P₁ with access to resource R₀ ifaffinity plane A₀ is determined to include affinity plane A₁.
 91. Amethod for use with a system, wherein the method is performed by atleast one computer processor executing computer program instructionsstored on at least one non-transitory computer-readable medium, thesystem comprising: a plurality of affinity planes associated with afirst person P₀; a plurality of sectors associated with first person P₀;data representing an association Affinity_P₀ (A₀, P₁) between anaffinity plane A₀ and second person P₁, wherein the affinity plane A₀ iswithin the plurality of affinity planes associated with first person P₀;data representing an association Sector_P₀(S₀, P₁) between a sector S₀and second person P₁, wherein the sector S₀ is within the plurality ofsectors associated with first person P₀; and data representing anassociation Sector_P₀ (S₁, R₀) between a sector S₁ and first resourceR₀, wherein the sector S₁ is within the plurality of sectors associatedwith first person P₀; wherein the method comprises: (1) determiningwhether sector S₀ includes sector S₁; and (2) granting person P₁ withaccess to resource R₀ if sector S₀ is determined to include sector S₁.92. A system comprising: at least one computer processor; at least onenon-transitory computer-readable medium comprising computer-programinstructions executable by the at least one computer processor toperform a method; a plurality of affinity planes associated with a firstperson P₀; a plurality of sectors associated with first person P₀; datarepresenting an association Affinity_P₀ (A₀, P₁) between an affinityplane A₀ and second person P₁, wherein the affinity plane A₀ is withinthe plurality of affinity planes associated with first person P₀; datarepresenting an association Sector_P₀(S₀, P₁) between a sector S₀ andsecond person P₁, wherein the sector S₀ is within the plurality ofsectors associated with first person P₀; and data representing anassociation Sector_P₀ (S₁, R₀) between a sector S₁ and first resourceR₀, wherein the sector S₁ is within the plurality of sectors associatedwith first person P₀; wherein the method comprises: (1) determiningwhether sector S₀ includes sector S₁; and (2) granting person P₁ withaccess to resource R₀ if sector S₀ is determined to include sector S₁.93. A method for use with a system, wherein the method is performed byat least one computer processor executing computer program instructionsstored on at least one non-transitory computer-readable medium, thesystem comprising: a plurality of affinity planes associated with afirst person P₀; a plurality of sectors associated with first person P₀;data representing an association Affinity_P₀ (A₀, P₁) between anaffinity plane A₀ and second person P₁, wherein the affinity plane A₀ iswithin the plurality of affinity planes associated with first person P₀;data representing an association Sector_P₀(S₀, P₁) between a sector S₀and second person P₁, wherein the sector S₀ is within the plurality ofsectors associated with first person P₀; and data representing anassociation Affinity_P₀ (A₁, R₀) between an affinity plane A₁ and afirst resource R₀, wherein the affinity plane A₁ is within the pluralityof affinity planes associated with first person P₀; wherein the methodcomprises: (1) determining whether affinity plane A₀ includes affinityplane A₁; and (2) granting person P₁ with access to resource R₀ ifaffinity plane A₀ is determined to include affinity plane A₁.
 94. Asystem comprising: at least one computer processor; at least onenon-transitory computer-readable medium comprising computer-programinstructions executable by the at least one computer processor toperform a method; a plurality of affinity planes associated with a firstperson P₀; a plurality of sectors associated with first person P₀; datarepresenting an association Affinity_P₀ (A₀, P₁) between an affinityplane A₀ and second person P₁, wherein the affinity plane A₀ is withinthe plurality of affinity planes associated with first person P₀; datarepresenting an association Sector_P₀(S₀, P₁) between a sector S₀ andsecond person P₁, wherein the sector S₀ is within the plurality ofsectors associated with first person P₀; and data representing anassociation Affinity_P₀ (A₁, R₀) between an affinity plane A₁ and afirst resource R₀, wherein the affinity plane A₁ is within the pluralityof affinity planes associated with first person P₀; wherein the methodcomprises: (1) determining whether affinity plane A₀ includes affinityplane A₁; and (2) granting person P₁ with access to resource R₀ ifaffinity plane A₀ is determined to include affinity plane A₁.
 95. Amethod for use with a system, wherein the method is performed by atleast one computer processor executing computer program instructionsstored on at least one non-transitory computer-readable medium, thesystem comprising: a plurality of affinity planes associated with afirst person P₀; and affinity plane association data representing aplurality of associations between the plurality of affinity planes and aplurality of resources and people; the method comprising: (1) displayinga graphical representation of each of the plurality of affinity planes,comprising: (a) for a first and second affinity plane in the pluralityof affinity planes: (i) selecting a first location at which to display agraphical representation of the first affinity plane; (ii) displayingthe graphical representation of the first affinity plane at the firstlocation; (iii) selecting a second location at which to display agraphical representation of the second affinity plane; (iv) displayingthe graphical representation of the second affinity plane at the secondlocation; wherein (1) (a) (i) and (1) (a) (iii) comprise selecting thefirst and second locations such that the distance between the first andsecond locations is based on the number of resources and/or people incommon between the first and second affinity planes.
 96. The method ofclaim 95, wherein (1) further comprises: (b) for a third and fourthaffinity plane in the plurality of affinity planes: (i) selecting athird location at which to display a graphical representation of thethird affinity plane; (ii) displaying the graphical representation ofthe third affinity plane at the third location; (iii) selecting a fourthlocation at which to display a graphical representation of the fourthaffinity plane; (iv) displaying the graphical representation of thefourth affinity plane at the fourth location; wherein (1) (b) (i) and(1) (b) (iii) comprise selecting the third and fourth locations suchthat the distance between the third and fourth locations is based on thenumber of resources and/or people in common between the third and fourthaffinity planes; wherein the distance between the first and secondlocations differs from the distance between the third and fourthlocations.
 97. A system comprising: at least one computer processor; atleast one non-transitory computer-readable medium comprisingcomputer-program instructions executable by the at least one computerprocessor to perform a method; a plurality of affinity planes associatedwith a first person P₀; and affinity plane association data representinga plurality of associations between the plurality of affinity planes anda plurality of resources and people; the method comprising: (1)displaying a graphical representation of each of the plurality ofaffinity planes, comprising: (a) for a first and second affinity planein the plurality of affinity planes: (i) selecting a first location atwhich to display a graphical representation of the first affinity plane;(ii) displaying the graphical representation of the first affinity planeat the first location; (iii) selecting a second location at which todisplay a graphical representation of the second affinity plane; (iv)displaying the graphical representation of the second affinity plane atthe second location; wherein (1) (a) (i) and (1) (a) (iii) compriseselecting the first and second locations such that the distance betweenthe first and second locations is based on the number of resourcesand/or people in common between the first and second affinity planes.98. The system of claim 95, wherein (1) further comprises: (b) for athird and fourth affinity plane in the plurality of affinity planes: (i)selecting a third location at which to display a graphicalrepresentation of the third affinity plane; (ii) displaying thegraphical representation of the third affinity plane at the thirdlocation; (iii) selecting a fourth location at which to display agraphical representation of the fourth affinity plane; (iv) displayingthe graphical representation of the fourth affinity plane at the fourthlocation; wherein (1) (b) (i) and (1) (b) (iii) comprise selecting thethird and fourth locations such that the distance between the third andfourth locations is based on the number of resources and/or people incommon between the third and fourth affinity planes; wherein thedistance between the first and second locations differs from thedistance between the third and fourth locations.
 99. A method for usewith a system, wherein the method is performed by at least one computerprocessor executing computer program instructions stored on at least onenon-transitory computer-readable medium, the system comprising: aplurality of affinity planes associated with a first person P₀; affinityplane association data representing a plurality of associations betweenthe plurality of affinity planes and a plurality of resources andpeople; the method comprising: (1) rendering a graphical representationof a first affinity plane in the plurality of affinity planes,comprising: (a) identifying a first value of a characteristic of thefirst affinity plane; (b) selecting a first graphical feature based onthe first value of the characteristic of the first affinity plane; (c)rendering the graphical representation of the first affinity plane tohave the first graphical feature; (2) rendering a graphicalrepresentation of a second affinity plane in the plurality of affinityplanes, comprising: (a) identifying a second value of the characteristicof the second affinity plane; (b) selecting a second graphical featurebased on the second value of the characteristic of the second affinityplane; (c) rendering the graphical representation of the second affinityplane to have the second graphical feature; wherein the first graphicalfeature differs from the second graphical feature.
 100. The method ofclaim 99, wherein the first graphical feature comprises a first size,wherein the second graphical feature comprises a second size, andwherein the first size differs from the second size.
 101. The method ofclaim 99, wherein the first graphical feature comprises a first color,wherein the second graphical feature comprises a second color, andwherein the first color differs from the second color.
 102. The methodof claim 99: wherein the characteristic of the first affinity planecomprises a number of people associated with the first affinity plane;and wherein the characteristic of the second affinity plane comprises anumber of people associated with the second affinity plane.
 103. Themethod of claim 99: wherein the characteristic of the first affinityplane comprises a number of resources associated with the first affinityplane; and wherein the characteristic of the second affinity planecomprises a number of resources associated with the second affinityplane.
 104. The method of claim 99: wherein the characteristic of thefirst affinity plane comprises a current activity level of the firstaffinity plane; and wherein the characteristic of the second affinityplane comprises a current activity level of the second affinity plane.105. A system comprising: at least one computer processor; at least onenon-transitory computer-readable medium comprising computer-programinstructions executable by the at least one computer processor toperform a method; a plurality of affinity planes associated with a firstperson P₀; affinity plane association data representing a plurality ofassociations between the plurality of affinity planes and a plurality ofresources and people; the method comprising: (1) rendering a graphicalrepresentation of a first affinity plane in the plurality of affinityplanes, comprising: (a) identifying a first value of a characteristic ofthe first affinity plane; (b) selecting a first graphical feature basedon the first value of the characteristic of the first affinity plane;(c) rendering the graphical representation of the first affinity planeto have the first graphical feature; (2) rendering a graphicalrepresentation of a second affinity plane in the plurality of affinityplanes, comprising: (a) identifying a second value of the characteristicof the second affinity plane; (b) selecting a second graphical featurebased on the second value of the characteristic of the second affinityplane; (c) rendering the graphical representation of the second affinityplane to have the second graphical feature; wherein the first graphicalfeature differs from the second graphical feature.
 106. A method for usewith a system, wherein the method is performed by at least one computerprocessor executing computer program instructions stored on at least onenon-transitory computer-readable medium, the system comprising: aplurality of affinity planes associated with a first person P₀; affinityplane association data representing a plurality of associations betweenthe plurality of affinity planes and a plurality of resources andpeople; and the method comprising: (1) identifying, for each of aplurality of people P_(n), an affinity contribution for person P_(n) inrelation to the first person P₀, based on at least one frequency ofoccurrence of person P_(n) in person P₀'s affinity planes; (2) summingthe affinity contributions for the plurality of people P_(n) to producean affinity total; and (3) identifying an affinity index for each of theplurality of people P_(n) by dividing person P_(n)'s affinitycontribution by the affinity total.
 107. The method of claim 106,wherein (1) comprises: (1) (a) for each of person P₀'s affinity planes:(i) identifying a weight of the affinity plane; (ii) multiplying theweight by a number of occurrences of person P_(n) in the affinity planeto produce a product; and (1) (b) summing the products from (1) (a) toproduce an affinity contribution for person P.
 108. A system comprising:at least one computer processor; at least one non-transitorycomputer-readable medium comprising computer-program instructionsexecutable by the at least one computer processor to perform a method; aplurality of affinity planes associated with a first person P₀; affinityplane association data representing a plurality of associations betweenthe plurality of affinity planes and a plurality of resources andpeople; and the method comprising: (1) identifying, for each of aplurality of people P_(n), an affinity contribution for person P_(n) inrelation to the first person P₀, based on at least one frequency ofoccurrence of person P_(n) in person P₀'s affinity planes; (2) summingthe affinity contributions for the plurality of people P_(n) to producean affinity total; and (3) identifying an affinity index for each of theplurality of people P_(n) by dividing person P_(n)'s affinitycontribution by the affinity total.